/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:09:09,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:09:09,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:09:09,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:09:09,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:09:09,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:09:09,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:09:09,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:09:09,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:09:09,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:09:09,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:09:09,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:09:09,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:09:09,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:09:09,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:09:09,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:09:09,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:09:09,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:09:09,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:09:09,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:09:09,529 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:09:09,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:09:09,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:09:09,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:09:09,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:09:09,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:09:09,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:09:09,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:09:09,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:09:09,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:09:09,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:09:09,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:09:09,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:09:09,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:09:09,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:09:09,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:09:09,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:09:09,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:09:09,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:09:09,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:09:09,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:09:09,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:09:09,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:09:09,553 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:09:09,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:09:09,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:09:09,554 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:09:09,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:09:09,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:09:09,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:09:09,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:09:09,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:09:09,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:09:09,555 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:09:09,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:09:09,556 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:09:09,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:09:09,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:09:09,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:09:09,556 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:09:09,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:09:09,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:09:09,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:09:09,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:09:09,556 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:09:09,557 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:09:09,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:09:09,557 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:09:09,557 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:09:09,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:09:09,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:09:09,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:09:09,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:09:09,733 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:09:09,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2022-04-28 03:09:09,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bdbe0bf0/d6e5f2cd03e34d11aaa78418d0faa92b/FLAG4ff8f2d27 [2022-04-28 03:09:10,140 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:09:10,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2022-04-28 03:09:10,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bdbe0bf0/d6e5f2cd03e34d11aaa78418d0faa92b/FLAG4ff8f2d27 [2022-04-28 03:09:10,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bdbe0bf0/d6e5f2cd03e34d11aaa78418d0faa92b [2022-04-28 03:09:10,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:09:10,156 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:09:10,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:09:10,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:09:10,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:09:10,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:09:10" (1/1) ... [2022-04-28 03:09:10,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8198ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:10, skipping insertion in model container [2022-04-28 03:09:10,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:09:10" (1/1) ... [2022-04-28 03:09:10,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:09:10,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:09:10,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2022-04-28 03:09:10,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2022-04-28 03:09:10,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2022-04-28 03:09:10,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2022-04-28 03:09:10,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2022-04-28 03:09:10,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2022-04-28 03:09:10,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2022-04-28 03:09:10,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2022-04-28 03:09:10,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2022-04-28 03:09:10,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2022-04-28 03:09:10,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2022-04-28 03:09:10,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2022-04-28 03:09:10,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2022-04-28 03:09:10,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2022-04-28 03:09:10,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2022-04-28 03:09:10,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2022-04-28 03:09:10,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:09:10,366 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:09:10,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2022-04-28 03:09:10,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2022-04-28 03:09:10,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2022-04-28 03:09:10,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2022-04-28 03:09:10,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2022-04-28 03:09:10,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2022-04-28 03:09:10,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2022-04-28 03:09:10,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2022-04-28 03:09:10,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2022-04-28 03:09:10,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2022-04-28 03:09:10,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2022-04-28 03:09:10,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2022-04-28 03:09:10,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2022-04-28 03:09:10,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2022-04-28 03:09:10,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2022-04-28 03:09:10,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2022-04-28 03:09:10,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:09:10,421 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:09:10,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:10 WrapperNode [2022-04-28 03:09:10,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:09:10,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:09:10,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:09:10,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:09:10,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:10" (1/1) ... [2022-04-28 03:09:10,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:10" (1/1) ... [2022-04-28 03:09:10,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:10" (1/1) ... [2022-04-28 03:09:10,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:10" (1/1) ... [2022-04-28 03:09:10,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:10" (1/1) ... [2022-04-28 03:09:10,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:10" (1/1) ... [2022-04-28 03:09:10,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:10" (1/1) ... [2022-04-28 03:09:10,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:09:10,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:09:10,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:09:10,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:09:10,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:10" (1/1) ... [2022-04-28 03:09:10,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:09:10,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:10,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:09:10,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:09:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:09:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:09:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:09:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:09:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:09:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:09:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:09:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:09:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:09:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:09:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:09:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:09:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:09:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:09:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:09:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:09:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:09:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:09:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:09:10,565 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:09:10,566 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:09:10,762 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:09:10,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:09:10,767 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-28 03:09:10,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:09:10 BoogieIcfgContainer [2022-04-28 03:09:10,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:09:10,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:09:10,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:09:10,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:09:10,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:09:10" (1/3) ... [2022-04-28 03:09:10,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7541b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:09:10, skipping insertion in model container [2022-04-28 03:09:10,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:10" (2/3) ... [2022-04-28 03:09:10,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7541b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:09:10, skipping insertion in model container [2022-04-28 03:09:10,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:09:10" (3/3) ... [2022-04-28 03:09:10,773 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2022-04-28 03:09:10,782 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:09:10,782 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-28 03:09:10,819 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:09:10,823 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a110135, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60c4298 [2022-04-28 03:09:10,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-28 03:09:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:09:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:09:10,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:10,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:10,835 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:10,838 INFO L85 PathProgramCache]: Analyzing trace with hash -189701311, now seen corresponding path program 1 times [2022-04-28 03:09:10,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:10,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [899543603] [2022-04-28 03:09:10,851 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash -189701311, now seen corresponding path program 2 times [2022-04-28 03:09:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:10,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216660538] [2022-04-28 03:09:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:11,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:11,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {74#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {68#true} is VALID [2022-04-28 03:09:11,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {68#true} assume true; {68#true} is VALID [2022-04-28 03:09:11,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68#true} {68#true} #149#return; {68#true} is VALID [2022-04-28 03:09:11,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {74#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:11,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {74#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {68#true} is VALID [2022-04-28 03:09:11,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2022-04-28 03:09:11,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #149#return; {68#true} is VALID [2022-04-28 03:09:11,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret7 := main(); {68#true} is VALID [2022-04-28 03:09:11,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {68#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {68#true} is VALID [2022-04-28 03:09:11,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {68#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {68#true} is VALID [2022-04-28 03:09:11,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {68#true} is VALID [2022-04-28 03:09:11,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0; {68#true} is VALID [2022-04-28 03:09:11,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#true} assume ~main__j~0 < ~main__limit~0; {68#true} is VALID [2022-04-28 03:09:11,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {73#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-28 03:09:11,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {73#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {69#false} is VALID [2022-04-28 03:09:11,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {69#false} assume !false; {69#false} is VALID [2022-04-28 03:09:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:11,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:11,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216660538] [2022-04-28 03:09:11,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216660538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:11,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:11,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:09:11,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:11,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [899543603] [2022-04-28 03:09:11,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [899543603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:11,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:11,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:09:11,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499286713] [2022-04-28 03:09:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:11,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:09:11,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:11,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:11,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:11,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:09:11,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:11,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:09:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:09:11,116 INFO L87 Difference]: Start difference. First operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:11,360 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2022-04-28 03:09:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:09:11,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:09:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-04-28 03:09:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-04-28 03:09:11,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 118 transitions. [2022-04-28 03:09:11,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:11,498 INFO L225 Difference]: With dead ends: 90 [2022-04-28 03:09:11,500 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 03:09:11,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:09:11,505 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 117 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:11,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 100 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:09:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 03:09:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2022-04-28 03:09:11,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:11,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 59 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:11,533 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 59 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:11,533 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 59 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:11,537 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-28 03:09:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-28 03:09:11,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:11,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:11,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 03:09:11,539 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 03:09:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:11,542 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-28 03:09:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-28 03:09:11,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:11,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:11,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:11,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-28 03:09:11,546 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2022-04-28 03:09:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:11,546 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-28 03:09:11,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:11,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2022-04-28 03:09:11,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-28 03:09:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:09:11,618 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:11,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:11,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:09:11,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:11,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1582601500, now seen corresponding path program 1 times [2022-04-28 03:09:11,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:11,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1400523743] [2022-04-28 03:09:11,622 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1582601500, now seen corresponding path program 2 times [2022-04-28 03:09:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:11,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828746937] [2022-04-28 03:09:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:11,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:11,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {537#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {530#true} is VALID [2022-04-28 03:09:11,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-28 03:09:11,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} #149#return; {530#true} is VALID [2022-04-28 03:09:11,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {537#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:11,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {537#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {530#true} is VALID [2022-04-28 03:09:11,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-28 03:09:11,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#true} {530#true} #149#return; {530#true} is VALID [2022-04-28 03:09:11,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {530#true} call #t~ret7 := main(); {530#true} is VALID [2022-04-28 03:09:11,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {530#true} is VALID [2022-04-28 03:09:11,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {530#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {530#true} is VALID [2022-04-28 03:09:11,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {535#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-28 03:09:11,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {535#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__i~0 < ~main__len~0; {535#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-28 03:09:11,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {535#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__j~0 < ~main__limit~0; {535#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-28 03:09:11,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(not (<= main_~main__len~0 main_~main__i~0))} assume !(1 + ~main__i~0 < ~main__len~0); {535#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-28 03:09:11,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#(not (<= main_~main__len~0 main_~main__i~0))} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {536#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-28 03:09:11,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {531#false} is VALID [2022-04-28 03:09:11,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#false} assume !false; {531#false} is VALID [2022-04-28 03:09:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:11,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:11,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828746937] [2022-04-28 03:09:11,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828746937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:11,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:11,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:11,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:11,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1400523743] [2022-04-28 03:09:11,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1400523743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:11,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:11,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:11,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629255703] [2022-04-28 03:09:11,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:11,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:09:11,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:11,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:11,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:11,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:09:11,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:11,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:09:11,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:09:11,759 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:12,132 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2022-04-28 03:09:12,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:12,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:09:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2022-04-28 03:09:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2022-04-28 03:09:12,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 168 transitions. [2022-04-28 03:09:12,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:12,285 INFO L225 Difference]: With dead ends: 153 [2022-04-28 03:09:12,285 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 03:09:12,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:09:12,290 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 137 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:12,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 99 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 03:09:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2022-04-28 03:09:12,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:12,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,325 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,326 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:12,328 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-04-28 03:09:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-04-28 03:09:12,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:12,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:12,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 03:09:12,335 INFO L87 Difference]: Start difference. First operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 03:09:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:12,338 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-04-28 03:09:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-04-28 03:09:12,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:12,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:12,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:12,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-28 03:09:12,340 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2022-04-28 03:09:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:12,340 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-28 03:09:12,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2022-04-28 03:09:12,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-28 03:09:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:09:12,399 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:12,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:12,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:09:12,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1585770269, now seen corresponding path program 1 times [2022-04-28 03:09:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:12,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [359339124] [2022-04-28 03:09:12,400 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1585770269, now seen corresponding path program 2 times [2022-04-28 03:09:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:12,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36527564] [2022-04-28 03:09:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:12,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {1177#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1170#true} is VALID [2022-04-28 03:09:12,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-28 03:09:12,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1170#true} {1170#true} #149#return; {1170#true} is VALID [2022-04-28 03:09:12,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1177#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:12,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1170#true} is VALID [2022-04-28 03:09:12,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-28 03:09:12,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #149#return; {1170#true} is VALID [2022-04-28 03:09:12,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret7 := main(); {1170#true} is VALID [2022-04-28 03:09:12,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {1170#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {1170#true} is VALID [2022-04-28 03:09:12,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {1170#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1175#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:12,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1175#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:12,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {1175#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:12,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {1175#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {1175#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:12,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {1175#(<= 0 main_~main__i~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1175#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:12,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {1175#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1176#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-28 03:09:12,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {1171#false} is VALID [2022-04-28 03:09:12,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2022-04-28 03:09:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:12,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:12,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36527564] [2022-04-28 03:09:12,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36527564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:12,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:12,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:12,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:12,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [359339124] [2022-04-28 03:09:12,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [359339124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:12,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:12,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695282746] [2022-04-28 03:09:12,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:12,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:09:12,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:12,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:12,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:09:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:12,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:09:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:09:12,463 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:12,658 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-28 03:09:12,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:09:12,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:09:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:12,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-04-28 03:09:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-04-28 03:09:12,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2022-04-28 03:09:12,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:12,726 INFO L225 Difference]: With dead ends: 75 [2022-04-28 03:09:12,726 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 03:09:12,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:12,728 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 144 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:12,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 66 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:09:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 03:09:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2022-04-28 03:09:12,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:12,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,768 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,768 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:12,769 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-28 03:09:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-28 03:09:12,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:12,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:12,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 03:09:12,770 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 03:09:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:12,772 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-28 03:09:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-28 03:09:12,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:12,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:12,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:12,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-28 03:09:12,773 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2022-04-28 03:09:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:12,774 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-28 03:09:12,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-28 03:09:12,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-28 03:09:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:09:12,830 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:12,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:12,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:09:12,831 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:12,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1816003151, now seen corresponding path program 1 times [2022-04-28 03:09:12,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:12,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [756122253] [2022-04-28 03:09:12,832 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1816003151, now seen corresponding path program 2 times [2022-04-28 03:09:12,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:12,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776674940] [2022-04-28 03:09:12,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:12,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:12,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:12,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {1599#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1592#true} is VALID [2022-04-28 03:09:12,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {1592#true} assume true; {1592#true} is VALID [2022-04-28 03:09:12,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1592#true} {1592#true} #149#return; {1592#true} is VALID [2022-04-28 03:09:12,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {1592#true} call ULTIMATE.init(); {1599#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:12,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {1599#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {1592#true} is VALID [2022-04-28 03:09:12,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {1592#true} assume true; {1592#true} is VALID [2022-04-28 03:09:12,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1592#true} {1592#true} #149#return; {1592#true} is VALID [2022-04-28 03:09:12,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {1592#true} call #t~ret7 := main(); {1592#true} is VALID [2022-04-28 03:09:12,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {1592#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {1592#true} is VALID [2022-04-28 03:09:12,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {1592#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:12,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {1597#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:12,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {1597#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:12,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {1597#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:12,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {1597#(<= 0 main_~main__i~0)} assume !(1 + ~main__i~0 < ~main__len~0); {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:12,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {1597#(<= 0 main_~main__i~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1597#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:12,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {1597#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1598#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-28 03:09:12,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {1598#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {1593#false} is VALID [2022-04-28 03:09:12,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {1593#false} assume !false; {1593#false} is VALID [2022-04-28 03:09:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:12,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:12,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776674940] [2022-04-28 03:09:12,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776674940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:12,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:12,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:12,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:12,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [756122253] [2022-04-28 03:09:12,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [756122253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:12,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:12,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:12,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420276488] [2022-04-28 03:09:12,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:12,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:09:12,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:12,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:12,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:09:12,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:12,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:09:12,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:09:12,884 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:13,122 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-28 03:09:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:09:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:09:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-04-28 03:09:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-04-28 03:09:13,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2022-04-28 03:09:13,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:13,198 INFO L225 Difference]: With dead ends: 96 [2022-04-28 03:09:13,198 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 03:09:13,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:13,199 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 139 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:13,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 84 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 03:09:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2022-04-28 03:09:13,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:13,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,236 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,236 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:13,238 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-28 03:09:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-28 03:09:13,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:13,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:13,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-28 03:09:13,239 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-28 03:09:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:13,241 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-28 03:09:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-28 03:09:13,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:13,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:13,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:13,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-28 03:09:13,243 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2022-04-28 03:09:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:13,243 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-28 03:09:13,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2022-04-28 03:09:13,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-28 03:09:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:09:13,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:13,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:13,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:09:13,302 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash -461519734, now seen corresponding path program 1 times [2022-04-28 03:09:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:13,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1582830100] [2022-04-28 03:09:13,303 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:13,303 INFO L85 PathProgramCache]: Analyzing trace with hash -461519734, now seen corresponding path program 2 times [2022-04-28 03:09:13,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:13,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363964631] [2022-04-28 03:09:13,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:13,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:13,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:13,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {2102#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2094#true} is VALID [2022-04-28 03:09:13,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-28 03:09:13,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2094#true} {2094#true} #149#return; {2094#true} is VALID [2022-04-28 03:09:13,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {2094#true} call ULTIMATE.init(); {2102#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:13,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2094#true} is VALID [2022-04-28 03:09:13,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-28 03:09:13,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2094#true} {2094#true} #149#return; {2094#true} is VALID [2022-04-28 03:09:13,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {2094#true} call #t~ret7 := main(); {2094#true} is VALID [2022-04-28 03:09:13,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {2094#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {2094#true} is VALID [2022-04-28 03:09:13,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {2094#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:13,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:13,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:13,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {2099#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:13,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(1 + ~main__i~0 < ~main__len~0); {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:13,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:13,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:13,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {2100#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~3);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2101#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-28 03:09:13,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {2101#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {2095#false} is VALID [2022-04-28 03:09:13,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {2095#false} assume !false; {2095#false} is VALID [2022-04-28 03:09:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:13,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:13,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363964631] [2022-04-28 03:09:13,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363964631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:13,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:13,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:13,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:13,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1582830100] [2022-04-28 03:09:13,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1582830100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:13,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:13,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:13,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684472180] [2022-04-28 03:09:13,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:13,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:09:13,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:13,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:13,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:13,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:13,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:13,366 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:13,783 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-04-28 03:09:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:13,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:09:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 03:09:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 03:09:13,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-28 03:09:13,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:13,868 INFO L225 Difference]: With dead ends: 95 [2022-04-28 03:09:13,868 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 03:09:13,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:09:13,869 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 159 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:13,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 97 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 03:09:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2022-04-28 03:09:13,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:13,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,941 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,942 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:13,944 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-28 03:09:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-28 03:09:13,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:13,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:13,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 03:09:13,944 INFO L87 Difference]: Start difference. First operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 93 states. [2022-04-28 03:09:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:13,946 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-28 03:09:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-28 03:09:13,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:13,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:13,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:13,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-28 03:09:13,948 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2022-04-28 03:09:13,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:13,948 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-28 03:09:13,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:13,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-28 03:09:14,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 03:09:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:09:14,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:14,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:14,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:09:14,013 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:14,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:14,014 INFO L85 PathProgramCache]: Analyzing trace with hash 788286019, now seen corresponding path program 1 times [2022-04-28 03:09:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:14,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1217648546] [2022-04-28 03:09:14,014 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:14,014 INFO L85 PathProgramCache]: Analyzing trace with hash 788286019, now seen corresponding path program 2 times [2022-04-28 03:09:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:14,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712990929] [2022-04-28 03:09:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:14,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:14,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {2600#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2593#true} is VALID [2022-04-28 03:09:14,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {2593#true} assume true; {2593#true} is VALID [2022-04-28 03:09:14,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2593#true} {2593#true} #149#return; {2593#true} is VALID [2022-04-28 03:09:14,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {2593#true} call ULTIMATE.init(); {2600#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:14,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {2600#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2593#true} is VALID [2022-04-28 03:09:14,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {2593#true} assume true; {2593#true} is VALID [2022-04-28 03:09:14,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2593#true} {2593#true} #149#return; {2593#true} is VALID [2022-04-28 03:09:14,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {2593#true} call #t~ret7 := main(); {2593#true} is VALID [2022-04-28 03:09:14,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {2593#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {2593#true} is VALID [2022-04-28 03:09:14,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {2593#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2593#true} is VALID [2022-04-28 03:09:14,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {2593#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-28 03:09:14,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__i~0 < ~main__len~0; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-28 03:09:14,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__j~0 < ~main__limit~0; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-28 03:09:14,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-28 03:09:14,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-28 03:09:14,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {2598#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-28 03:09:14,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {2598#(not (<= main_~main__len~0 main_~main__i~0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {2599#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-28 03:09:14,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {2599#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {2594#false} is VALID [2022-04-28 03:09:14,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {2594#false} assume !false; {2594#false} is VALID [2022-04-28 03:09:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:14,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712990929] [2022-04-28 03:09:14,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712990929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:14,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:14,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:14,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:14,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1217648546] [2022-04-28 03:09:14,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1217648546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:14,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:14,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214454461] [2022-04-28 03:09:14,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:09:14,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:14,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:14,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:09:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:14,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:09:14,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:09:14,067 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:14,334 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-28 03:09:14,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:14,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:09:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-04-28 03:09:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-04-28 03:09:14,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2022-04-28 03:09:14,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:14,390 INFO L225 Difference]: With dead ends: 69 [2022-04-28 03:09:14,390 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:09:14,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:09:14,390 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 109 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:14,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 66 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:09:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:09:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2022-04-28 03:09:14,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:14,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,448 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,448 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:14,450 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-28 03:09:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-28 03:09:14,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:14,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:14,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 03:09:14,450 INFO L87 Difference]: Start difference. First operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 03:09:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:14,452 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-28 03:09:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-28 03:09:14,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:14,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:14,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:14,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-28 03:09:14,453 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2022-04-28 03:09:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:14,454 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-28 03:09:14,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-28 03:09:14,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 03:09:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:09:14,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:14,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:14,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:09:14,520 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1422206761, now seen corresponding path program 1 times [2022-04-28 03:09:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:14,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1889456955] [2022-04-28 03:09:14,520 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1422206761, now seen corresponding path program 2 times [2022-04-28 03:09:14,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:14,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379160799] [2022-04-28 03:09:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:14,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:14,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:14,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {2988#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2981#true} is VALID [2022-04-28 03:09:14,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {2981#true} assume true; {2981#true} is VALID [2022-04-28 03:09:14,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2981#true} {2981#true} #149#return; {2981#true} is VALID [2022-04-28 03:09:14,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {2981#true} call ULTIMATE.init(); {2988#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:14,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {2988#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {2981#true} is VALID [2022-04-28 03:09:14,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {2981#true} assume true; {2981#true} is VALID [2022-04-28 03:09:14,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2981#true} {2981#true} #149#return; {2981#true} is VALID [2022-04-28 03:09:14,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {2981#true} call #t~ret7 := main(); {2981#true} is VALID [2022-04-28 03:09:14,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {2981#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {2981#true} is VALID [2022-04-28 03:09:14,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {2981#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {2981#true} is VALID [2022-04-28 03:09:14,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {2981#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:14,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {2986#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:14,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {2986#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:14,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {2986#(<= 0 main_~main__j~0)} assume !(1 + ~main__i~0 < ~main__len~0); {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:14,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {2986#(<= 0 main_~main__j~0)} havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:14,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {2986#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:14,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {2986#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~3);havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2986#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:14,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {2986#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {2987#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-28 03:09:14,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {2987#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {2982#false} is VALID [2022-04-28 03:09:14,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {2982#false} assume !false; {2982#false} is VALID [2022-04-28 03:09:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:14,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379160799] [2022-04-28 03:09:14,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379160799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:14,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:14,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:14,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:14,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1889456955] [2022-04-28 03:09:14,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1889456955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:14,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:14,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097006494] [2022-04-28 03:09:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:14,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:09:14,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:14,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:14,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:09:14,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:14,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:09:14,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:09:14,572 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:14,886 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-04-28 03:09:14,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:09:14,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:09:14,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-04-28 03:09:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-04-28 03:09:14,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 97 transitions. [2022-04-28 03:09:14,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:14,960 INFO L225 Difference]: With dead ends: 91 [2022-04-28 03:09:14,960 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 03:09:14,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:14,961 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 116 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:14,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 81 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 03:09:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2022-04-28 03:09:15,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:15,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,033 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,033 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:15,035 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-28 03:09:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-28 03:09:15,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:15,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:15,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-28 03:09:15,036 INFO L87 Difference]: Start difference. First operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-28 03:09:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:15,050 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-28 03:09:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-28 03:09:15,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:15,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:15,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:15,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-28 03:09:15,052 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2022-04-28 03:09:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:15,052 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-28 03:09:15,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2022-04-28 03:09:15,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-28 03:09:15,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:09:15,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:15,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:15,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 03:09:15,121 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:15,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1332934067, now seen corresponding path program 1 times [2022-04-28 03:09:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:15,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [663040023] [2022-04-28 03:09:15,121 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1332934067, now seen corresponding path program 2 times [2022-04-28 03:09:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:15,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424389048] [2022-04-28 03:09:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:15,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:15,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {3459#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3451#true} is VALID [2022-04-28 03:09:15,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-28 03:09:15,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3451#true} {3451#true} #149#return; {3451#true} is VALID [2022-04-28 03:09:15,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {3451#true} call ULTIMATE.init(); {3459#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:15,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {3459#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3451#true} is VALID [2022-04-28 03:09:15,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-28 03:09:15,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3451#true} {3451#true} #149#return; {3451#true} is VALID [2022-04-28 03:09:15,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {3451#true} call #t~ret7 := main(); {3451#true} is VALID [2022-04-28 03:09:15,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {3451#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {3451#true} is VALID [2022-04-28 03:09:15,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {3451#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3451#true} is VALID [2022-04-28 03:09:15,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {3451#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3451#true} is VALID [2022-04-28 03:09:15,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {3451#true} assume ~main__i~0 < ~main__len~0; {3451#true} is VALID [2022-04-28 03:09:15,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {3451#true} assume ~main__j~0 < ~main__limit~0; {3451#true} is VALID [2022-04-28 03:09:15,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {3451#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3451#true} is VALID [2022-04-28 03:09:15,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {3451#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3456#(or (and (not (<= 0 main_~main__i~0)) (= main_~__VERIFIER_assert__cond~1 0)) (and (= main_~__VERIFIER_assert__cond~1 1) (<= 0 main_~main__i~0)))} is VALID [2022-04-28 03:09:15,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {3456#(or (and (not (<= 0 main_~main__i~0)) (= main_~__VERIFIER_assert__cond~1 0)) (and (= main_~__VERIFIER_assert__cond~1 1) (<= 0 main_~main__i~0)))} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {3457#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:15,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {3457#(<= 0 main_~main__i~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3457#(<= 0 main_~main__i~0)} is VALID [2022-04-28 03:09:15,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {3457#(<= 0 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3458#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-28 03:09:15,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {3458#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {3452#false} is VALID [2022-04-28 03:09:15,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2022-04-28 03:09:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:15,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:15,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424389048] [2022-04-28 03:09:15,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424389048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:15,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:15,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:15,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:15,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [663040023] [2022-04-28 03:09:15,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [663040023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:15,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:15,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:15,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820797690] [2022-04-28 03:09:15,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:15,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:09:15,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:15,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:15,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:15,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:15,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:15,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:15,200 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:15,558 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-04-28 03:09:15,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:15,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:09:15,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-04-28 03:09:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-04-28 03:09:15,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2022-04-28 03:09:15,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:15,622 INFO L225 Difference]: With dead ends: 73 [2022-04-28 03:09:15,622 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:09:15,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:09:15,623 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 153 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:15,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 59 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:09:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2022-04-28 03:09:15,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:15,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,698 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,698 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:15,700 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-04-28 03:09:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-28 03:09:15,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:15,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:15,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:09:15,700 INFO L87 Difference]: Start difference. First operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:09:15,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:15,701 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-04-28 03:09:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-28 03:09:15,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:15,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:15,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:15,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-28 03:09:15,703 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2022-04-28 03:09:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:15,703 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-28 03:09:15,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2022-04-28 03:09:15,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-28 03:09:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:09:15,777 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:15,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:15,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 03:09:15,778 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:15,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:15,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1628720009, now seen corresponding path program 1 times [2022-04-28 03:09:15,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:15,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [915011479] [2022-04-28 03:09:15,778 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:15,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1628720009, now seen corresponding path program 2 times [2022-04-28 03:09:15,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:15,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950660236] [2022-04-28 03:09:15,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:15,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:15,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:15,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {3859#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3851#true} is VALID [2022-04-28 03:09:15,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 03:09:15,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3851#true} {3851#true} #149#return; {3851#true} is VALID [2022-04-28 03:09:15,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3859#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:15,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {3859#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {3851#true} is VALID [2022-04-28 03:09:15,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 03:09:15,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #149#return; {3851#true} is VALID [2022-04-28 03:09:15,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret7 := main(); {3851#true} is VALID [2022-04-28 03:09:15,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {3851#true} is VALID [2022-04-28 03:09:15,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {3851#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:15,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:15,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:15,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {3856#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:15,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:15,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:15,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:15,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:15,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:15,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {3857#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {3858#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-28 03:09:15,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {3858#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {3852#false} is VALID [2022-04-28 03:09:15,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-28 03:09:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:15,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:15,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950660236] [2022-04-28 03:09:15,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950660236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:15,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:15,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:15,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:15,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [915011479] [2022-04-28 03:09:15,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [915011479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:15,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:15,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:15,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405377186] [2022-04-28 03:09:15,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:15,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:09:15,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:15,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:15,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:15,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:15,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:15,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:15,879 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:16,168 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-28 03:09:16,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:16,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:09:16,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 03:09:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 03:09:16,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-28 03:09:16,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:16,232 INFO L225 Difference]: With dead ends: 61 [2022-04-28 03:09:16,232 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 03:09:16,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:09:16,234 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:16,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 66 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:16,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 03:09:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-04-28 03:09:16,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:16,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,313 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,313 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:16,316 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-28 03:09:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-28 03:09:16,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:16,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:16,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 03:09:16,317 INFO L87 Difference]: Start difference. First operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 03:09:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:16,318 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-28 03:09:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-28 03:09:16,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:16,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:16,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:16,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-28 03:09:16,319 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2022-04-28 03:09:16,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:16,319 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-28 03:09:16,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-28 03:09:16,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-28 03:09:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:09:16,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:16,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:16,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 03:09:16,392 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:16,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:16,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1049284141, now seen corresponding path program 1 times [2022-04-28 03:09:16,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:16,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759470739] [2022-04-28 03:09:16,393 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1049284141, now seen corresponding path program 2 times [2022-04-28 03:09:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:16,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914833898] [2022-04-28 03:09:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:16,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:16,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:16,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {4205#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4198#true} is VALID [2022-04-28 03:09:16,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {4198#true} assume true; {4198#true} is VALID [2022-04-28 03:09:16,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4198#true} {4198#true} #149#return; {4198#true} is VALID [2022-04-28 03:09:16,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {4198#true} call ULTIMATE.init(); {4205#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:16,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {4205#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4198#true} is VALID [2022-04-28 03:09:16,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {4198#true} assume true; {4198#true} is VALID [2022-04-28 03:09:16,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4198#true} {4198#true} #149#return; {4198#true} is VALID [2022-04-28 03:09:16,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {4198#true} call #t~ret7 := main(); {4198#true} is VALID [2022-04-28 03:09:16,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {4198#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {4198#true} is VALID [2022-04-28 03:09:16,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {4198#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4198#true} is VALID [2022-04-28 03:09:16,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {4198#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:16,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {4203#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:16,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {4203#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:16,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {4203#(<= 0 main_~main__j~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:16,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:16,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:16,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:16,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:16,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4203#(<= 0 main_~main__j~0)} is VALID [2022-04-28 03:09:16,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {4203#(<= 0 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4204#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-28 03:09:16,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {4204#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {4199#false} is VALID [2022-04-28 03:09:16,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {4199#false} assume !false; {4199#false} is VALID [2022-04-28 03:09:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:16,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:16,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914833898] [2022-04-28 03:09:16,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914833898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:16,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:16,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:16,454 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:16,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759470739] [2022-04-28 03:09:16,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759470739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:16,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:16,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099609420] [2022-04-28 03:09:16,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:16,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:09:16,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:16,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:16,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:09:16,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:16,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:09:16,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:09:16,465 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:16,681 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-28 03:09:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:09:16,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:09:16,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 03:09:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-28 03:09:16,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-28 03:09:16,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:16,732 INFO L225 Difference]: With dead ends: 61 [2022-04-28 03:09:16,732 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 03:09:16,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:16,733 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 94 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:16,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 57 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:09:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 03:09:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2022-04-28 03:09:16,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:16,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,822 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,822 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:16,823 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-28 03:09:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-28 03:09:16,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:16,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:16,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 03:09:16,823 INFO L87 Difference]: Start difference. First operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 03:09:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:16,824 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-28 03:09:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-28 03:09:16,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:16,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:16,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:16,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-28 03:09:16,825 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2022-04-28 03:09:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:16,825 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-28 03:09:16,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-28 03:09:16,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 03:09:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:09:16,906 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:16,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:16,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 03:09:16,906 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:16,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1831933135, now seen corresponding path program 1 times [2022-04-28 03:09:16,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:16,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [939788646] [2022-04-28 03:09:16,907 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:16,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1831933135, now seen corresponding path program 2 times [2022-04-28 03:09:16,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:16,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083104865] [2022-04-28 03:09:16,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:16,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:16,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:16,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {4543#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4536#true} is VALID [2022-04-28 03:09:16,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {4536#true} assume true; {4536#true} is VALID [2022-04-28 03:09:16,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4536#true} {4536#true} #149#return; {4536#true} is VALID [2022-04-28 03:09:16,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {4536#true} call ULTIMATE.init(); {4543#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:16,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {4543#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4536#true} is VALID [2022-04-28 03:09:16,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {4536#true} assume true; {4536#true} is VALID [2022-04-28 03:09:16,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4536#true} {4536#true} #149#return; {4536#true} is VALID [2022-04-28 03:09:16,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {4536#true} call #t~ret7 := main(); {4536#true} is VALID [2022-04-28 03:09:16,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {4536#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {4536#true} is VALID [2022-04-28 03:09:16,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {4536#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4536#true} is VALID [2022-04-28 03:09:16,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {4536#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4536#true} is VALID [2022-04-28 03:09:16,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {4536#true} assume ~main__i~0 < ~main__len~0; {4536#true} is VALID [2022-04-28 03:09:16,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {4536#true} assume ~main__j~0 < ~main__limit~0; {4536#true} is VALID [2022-04-28 03:09:16,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {4536#true} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-28 03:09:16,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-28 03:09:16,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-28 03:09:16,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-28 03:09:16,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-28 03:09:16,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-28 03:09:16,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-28 03:09:16,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {4541#(<= (+ 2 main_~main__i~0) main_~main__len~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4542#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-28 03:09:16,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {4542#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {4537#false} is VALID [2022-04-28 03:09:16,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {4537#false} assume !false; {4537#false} is VALID [2022-04-28 03:09:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:16,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:16,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083104865] [2022-04-28 03:09:16,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083104865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:16,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:16,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:16,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:16,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [939788646] [2022-04-28 03:09:16,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [939788646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:16,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:16,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:16,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58205831] [2022-04-28 03:09:16,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:16,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:09:16,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:16,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:16,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:16,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:09:16,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:16,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:09:16,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:09:16,980 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:17,360 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-28 03:09:17,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:17,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:09:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 03:09:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 03:09:17,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-28 03:09:17,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:17,430 INFO L225 Difference]: With dead ends: 69 [2022-04-28 03:09:17,430 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:09:17,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:09:17,431 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 77 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:17,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 70 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:09:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2022-04-28 03:09:17,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:17,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:17,507 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:17,507 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:17,508 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-28 03:09:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-28 03:09:17,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:17,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:17,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 03:09:17,509 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 03:09:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:17,510 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-28 03:09:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-28 03:09:17,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:17,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:17,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:17,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-28 03:09:17,511 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2022-04-28 03:09:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:17,511 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-28 03:09:17,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:17,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2022-04-28 03:09:17,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-28 03:09:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:09:17,581 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:17,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:17,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 03:09:17,581 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash 955355481, now seen corresponding path program 1 times [2022-04-28 03:09:17,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:17,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [209653884] [2022-04-28 03:09:17,582 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash 955355481, now seen corresponding path program 2 times [2022-04-28 03:09:17,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:17,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036443394] [2022-04-28 03:09:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:17,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:17,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:17,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {4913#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4905#true} is VALID [2022-04-28 03:09:17,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {4905#true} assume true; {4905#true} is VALID [2022-04-28 03:09:17,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4905#true} {4905#true} #149#return; {4905#true} is VALID [2022-04-28 03:09:17,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {4905#true} call ULTIMATE.init(); {4913#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:17,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {4913#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {4905#true} is VALID [2022-04-28 03:09:17,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {4905#true} assume true; {4905#true} is VALID [2022-04-28 03:09:17,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4905#true} {4905#true} #149#return; {4905#true} is VALID [2022-04-28 03:09:17,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {4905#true} call #t~ret7 := main(); {4905#true} is VALID [2022-04-28 03:09:17,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {4905#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {4905#true} is VALID [2022-04-28 03:09:17,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {4905#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-28 03:09:17,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {4910#(= main_~main__i~0 0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-28 03:09:17,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {4910#(= main_~main__i~0 0)} assume ~main__i~0 < ~main__len~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-28 03:09:17,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {4910#(= main_~main__i~0 0)} assume ~main__j~0 < ~main__limit~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-28 03:09:17,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {4910#(= main_~main__i~0 0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-28 03:09:17,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-28 03:09:17,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {4910#(= main_~main__i~0 0)} is VALID [2022-04-28 03:09:17,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {4910#(= main_~main__i~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-28 03:09:17,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-28 03:09:17,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-28 03:09:17,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4910#(= main_~main__i~0 0)} is VALID [2022-04-28 03:09:17,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {4910#(= main_~main__i~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4911#(<= 1 main_~main__i~0)} is VALID [2022-04-28 03:09:17,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {4911#(<= 1 main_~main__i~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4912#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-28 03:09:17,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {4912#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {4906#false} is VALID [2022-04-28 03:09:17,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {4906#false} assume !false; {4906#false} is VALID [2022-04-28 03:09:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:17,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:17,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036443394] [2022-04-28 03:09:17,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036443394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:17,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:17,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:17,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:17,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [209653884] [2022-04-28 03:09:17,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [209653884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:17,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:17,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354921486] [2022-04-28 03:09:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:17,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:09:17,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:17,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:17,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:17,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:17,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:17,644 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:18,066 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-28 03:09:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:18,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:09:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-28 03:09:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-28 03:09:18,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2022-04-28 03:09:18,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:18,133 INFO L225 Difference]: With dead ends: 74 [2022-04-28 03:09:18,133 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 03:09:18,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:09:18,134 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 118 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:18,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 59 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 03:09:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2022-04-28 03:09:18,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:18,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,220 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,220 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:18,221 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-28 03:09:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-28 03:09:18,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:18,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:18,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 03:09:18,221 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 03:09:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:18,222 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-28 03:09:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-28 03:09:18,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:18,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:18,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:18,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-28 03:09:18,223 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2022-04-28 03:09:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:18,223 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-28 03:09:18,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-28 03:09:18,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 03:09:18,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:09:18,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:18,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:18,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 03:09:18,303 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:18,303 INFO L85 PathProgramCache]: Analyzing trace with hash -448748011, now seen corresponding path program 1 times [2022-04-28 03:09:18,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:18,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2034411151] [2022-04-28 03:09:18,303 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:18,303 INFO L85 PathProgramCache]: Analyzing trace with hash -448748011, now seen corresponding path program 2 times [2022-04-28 03:09:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:18,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369664945] [2022-04-28 03:09:18,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:18,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:18,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:18,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {5299#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {5290#true} is VALID [2022-04-28 03:09:18,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {5290#true} assume true; {5290#true} is VALID [2022-04-28 03:09:18,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5290#true} {5290#true} #149#return; {5290#true} is VALID [2022-04-28 03:09:18,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {5290#true} call ULTIMATE.init(); {5299#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:18,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {5299#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {5290#true} is VALID [2022-04-28 03:09:18,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {5290#true} assume true; {5290#true} is VALID [2022-04-28 03:09:18,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5290#true} {5290#true} #149#return; {5290#true} is VALID [2022-04-28 03:09:18,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {5290#true} call #t~ret7 := main(); {5290#true} is VALID [2022-04-28 03:09:18,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {5290#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {5290#true} is VALID [2022-04-28 03:09:18,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {5290#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {5295#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {5296#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5297#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {5297#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {5297#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:18,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {5297#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {5298#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-28 03:09:18,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {5298#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {5291#false} is VALID [2022-04-28 03:09:18,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {5291#false} assume !false; {5291#false} is VALID [2022-04-28 03:09:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:18,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:18,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369664945] [2022-04-28 03:09:18,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369664945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:18,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:18,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:18,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:18,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2034411151] [2022-04-28 03:09:18,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2034411151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:18,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:18,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:18,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272589621] [2022-04-28 03:09:18,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:18,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:09:18,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:18,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:18,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:09:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:18,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:09:18,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:18,406 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:18,806 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-28 03:09:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:09:18,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:09:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-28 03:09:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-28 03:09:18,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2022-04-28 03:09:18,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:18,862 INFO L225 Difference]: With dead ends: 62 [2022-04-28 03:09:18,862 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 03:09:18,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:09:18,863 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 108 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:18,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 68 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 03:09:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-04-28 03:09:18,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:18,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,951 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,951 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:18,952 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 03:09:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 03:09:18,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:18,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:18,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 03:09:18,953 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 03:09:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:18,954 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 03:09:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 03:09:18,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:18,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:18,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:18,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-28 03:09:18,955 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2022-04-28 03:09:18,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:18,955 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-28 03:09:18,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:18,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 40 transitions. [2022-04-28 03:09:19,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-28 03:09:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:09:19,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:19,035 INFO L195 NwaCegarLoop]: 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] [2022-04-28 03:09:19,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 03:09:19,035 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:19,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:19,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1026283297, now seen corresponding path program 1 times [2022-04-28 03:09:19,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:19,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [165334241] [2022-04-28 03:09:19,036 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1026283297, now seen corresponding path program 2 times [2022-04-28 03:09:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:19,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213113287] [2022-04-28 03:09:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:19,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:19,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:19,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {5638#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {5630#true} is VALID [2022-04-28 03:09:19,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {5630#true} assume true; {5630#true} is VALID [2022-04-28 03:09:19,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5630#true} {5630#true} #149#return; {5630#true} is VALID [2022-04-28 03:09:19,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {5630#true} call ULTIMATE.init(); {5638#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:19,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {5638#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {5630#true} is VALID [2022-04-28 03:09:19,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {5630#true} assume true; {5630#true} is VALID [2022-04-28 03:09:19,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5630#true} {5630#true} #149#return; {5630#true} is VALID [2022-04-28 03:09:19,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {5630#true} call #t~ret7 := main(); {5630#true} is VALID [2022-04-28 03:09:19,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {5630#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {5630#true} is VALID [2022-04-28 03:09:19,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {5630#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {5630#true} is VALID [2022-04-28 03:09:19,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {5630#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:19,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {5635#(= main_~main__j~0 0)} assume ~main__i~0 < ~main__len~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:19,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {5635#(= main_~main__j~0 0)} assume ~main__j~0 < ~main__limit~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:19,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {5635#(= main_~main__j~0 0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:19,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:19,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {5635#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:19,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {5635#(= main_~main__j~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:19,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:19,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:19,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5635#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:19,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {5635#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5636#(<= 1 main_~main__j~0)} is VALID [2022-04-28 03:09:19,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {5636#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {5636#(<= 1 main_~main__j~0)} is VALID [2022-04-28 03:09:19,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {5636#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {5636#(<= 1 main_~main__j~0)} is VALID [2022-04-28 03:09:19,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {5636#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {5637#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-28 03:09:19,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {5631#false} is VALID [2022-04-28 03:09:19,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {5631#false} assume !false; {5631#false} is VALID [2022-04-28 03:09:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:19,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:19,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213113287] [2022-04-28 03:09:19,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213113287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:19,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:19,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:19,091 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:19,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [165334241] [2022-04-28 03:09:19,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [165334241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:19,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:19,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:19,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30611941] [2022-04-28 03:09:19,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:19,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:09:19,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:19,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:19,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:19,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:19,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:19,105 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:19,652 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-28 03:09:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:19,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:09:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 03:09:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 03:09:19,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-28 03:09:19,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:19,742 INFO L225 Difference]: With dead ends: 87 [2022-04-28 03:09:19,742 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 03:09:19,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:09:19,743 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:19,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 77 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 03:09:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2022-04-28 03:09:19,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:19,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,819 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,823 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:19,824 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-28 03:09:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-28 03:09:19,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:19,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:19,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-28 03:09:19,825 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-28 03:09:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:19,827 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-28 03:09:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-28 03:09:19,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:19,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:19,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:19,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-28 03:09:19,832 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2022-04-28 03:09:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:19,832 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-28 03:09:19,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-28 03:09:19,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-28 03:09:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:09:19,928 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:19,928 INFO L195 NwaCegarLoop]: 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] [2022-04-28 03:09:19,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 03:09:19,928 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1750007973, now seen corresponding path program 1 times [2022-04-28 03:09:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:19,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1737732814] [2022-04-28 03:09:19,929 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1750007973, now seen corresponding path program 2 times [2022-04-28 03:09:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:19,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569360716] [2022-04-28 03:09:19,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:19,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:19,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {6070#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {6061#true} is VALID [2022-04-28 03:09:19,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {6061#true} assume true; {6061#true} is VALID [2022-04-28 03:09:19,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6061#true} {6061#true} #149#return; {6061#true} is VALID [2022-04-28 03:09:19,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {6061#true} call ULTIMATE.init(); {6070#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:19,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {6070#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {6061#true} is VALID [2022-04-28 03:09:19,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {6061#true} assume true; {6061#true} is VALID [2022-04-28 03:09:19,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6061#true} {6061#true} #149#return; {6061#true} is VALID [2022-04-28 03:09:19,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {6061#true} call #t~ret7 := main(); {6061#true} is VALID [2022-04-28 03:09:19,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {6061#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {6061#true} is VALID [2022-04-28 03:09:19,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {6061#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {6066#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-28 03:09:19,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {6068#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} assume !(0 == ~__VERIFIER_assert__cond~13);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {6069#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-28 03:09:19,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {6069#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {6062#false} is VALID [2022-04-28 03:09:19,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {6062#false} assume !false; {6062#false} is VALID [2022-04-28 03:09:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:19,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:19,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569360716] [2022-04-28 03:09:19,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569360716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:19,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:19,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:19,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:19,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1737732814] [2022-04-28 03:09:19,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1737732814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:19,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:19,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:19,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738048050] [2022-04-28 03:09:19,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:19,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:09:19,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:19,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:20,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:20,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:09:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:09:20,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:20,012 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:20,402 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 03:09:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:09:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:09:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-28 03:09:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-28 03:09:20,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2022-04-28 03:09:20,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:20,463 INFO L225 Difference]: With dead ends: 60 [2022-04-28 03:09:20,463 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 03:09:20,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:09:20,464 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 93 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:20,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 63 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 03:09:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2022-04-28 03:09:20,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:20,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:20,545 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:20,545 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:20,546 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-28 03:09:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-28 03:09:20,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:20,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:20,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 03:09:20,546 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 03:09:20,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:20,547 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-28 03:09:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-28 03:09:20,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:20,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:20,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:20,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 03:09:20,562 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2022-04-28 03:09:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:20,562 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 03:09:20,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:20,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 03:09:20,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 03:09:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:09:20,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:20,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:20,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 03:09:20,639 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-28 03:09:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1584330853, now seen corresponding path program 1 times [2022-04-28 03:09:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:20,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1934114484] [2022-04-28 03:09:20,639 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1584330853, now seen corresponding path program 2 times [2022-04-28 03:09:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:20,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968082123] [2022-04-28 03:09:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:20,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:20,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:20,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {6394#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {6385#true} is VALID [2022-04-28 03:09:20,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {6385#true} assume true; {6385#true} is VALID [2022-04-28 03:09:20,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6385#true} {6385#true} #149#return; {6385#true} is VALID [2022-04-28 03:09:20,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {6385#true} call ULTIMATE.init(); {6394#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:20,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {6394#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_334~0)| ~__return_334~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(36, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_334~0 := 0; {6385#true} is VALID [2022-04-28 03:09:20,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {6385#true} assume true; {6385#true} is VALID [2022-04-28 03:09:20,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6385#true} {6385#true} #149#return; {6385#true} is VALID [2022-04-28 03:09:20,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {6385#true} call #t~ret7 := main(); {6385#true} is VALID [2022-04-28 03:09:20,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {6385#true} havoc ~main__len~0;havoc ~main__i~0;havoc ~main__j~0;havoc ~main__bufsize~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__bufsize~0 := #t~nondet4;havoc #t~nondet4; {6385#true} is VALID [2022-04-28 03:09:20,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {6385#true} assume !(~main__bufsize~0 < 0);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__len~0 := #t~nondet5;havoc #t~nondet5;~main__limit~0 := ~main__bufsize~0 - 4;~main__i~0 := 0; {6385#true} is VALID [2022-04-28 03:09:20,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {6385#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:20,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {6390#(= main_~main__j~0 0)} assume ~main__i~0 < ~main__len~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:20,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {6390#(= main_~main__j~0 0)} assume ~main__j~0 < ~main__limit~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:20,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {6390#(= main_~main__j~0 0)} assume 1 + ~main__i~0 < ~main__len~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 1 + ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:20,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:20,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet6;havoc #t~nondet6; {6390#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:20,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {6390#(= main_~main__j~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:20,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:20,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~7);havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:20,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6390#(= main_~main__j~0 0)} is VALID [2022-04-28 03:09:20,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {6390#(= main_~main__j~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9);~main____CPAchecker_TMP_1~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_2~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__i~0 < ~main__len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6391#(<= 1 main_~main__j~0)} is VALID [2022-04-28 03:09:20,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {6391#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__i~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6391#(<= 1 main_~main__j~0)} is VALID [2022-04-28 03:09:20,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {6391#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6391#(<= 1 main_~main__j~0)} is VALID [2022-04-28 03:09:20,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {6391#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {6391#(<= 1 main_~main__j~0)} is VALID [2022-04-28 03:09:20,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {6391#(<= 1 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~13);~main____CPAchecker_TMP_3~0 := ~main__j~0;~main__j~0 := 1 + ~main__j~0;~main____CPAchecker_TMP_4~0 := ~main__i~0;~main__i~0 := 1 + ~main__i~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__j~0 < ~main__bufsize~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {6392#(<= 2 main_~main__j~0)} is VALID [2022-04-28 03:09:20,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {6392#(<= 2 main_~main__j~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__j~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {6393#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-28 03:09:20,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {6393#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {6386#false} is VALID [2022-04-28 03:09:20,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {6386#false} assume !false; {6386#false} is VALID [2022-04-28 03:09:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:20,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:20,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968082123] [2022-04-28 03:09:20,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968082123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:20,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:20,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:20,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:20,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1934114484] [2022-04-28 03:09:20,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1934114484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:20,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:20,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:20,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879237936] [2022-04-28 03:09:20,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:09:20,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:20,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:20,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:20,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:09:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:20,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:09:20,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:20,718 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:21,634 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2022-04-28 03:09:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:09:21,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:09:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-28 03:09:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-28 03:09:21,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-04-28 03:09:21,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:21,750 INFO L225 Difference]: With dead ends: 125 [2022-04-28 03:09:21,751 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:09:21,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:09:21,751 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 145 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:21,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 86 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:09:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:09:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:09:21,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:21,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:09:21,752 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:09:21,752 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:09:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:21,752 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:09:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:09:21,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:21,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:21,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:09:21,753 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 03:09:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:21,753 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:09:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:09:21,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:21,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:21,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:21,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:09:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:09:21,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-04-28 03:09:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:21,753 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:09:21,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:21,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:09:21,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:09:21,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:21,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-28 03:09:21,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-28 03:09:21,759 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-28 03:09:21,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-28 03:09:21,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-28 03:09:21,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-28 03:09:21,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-28 03:09:21,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-28 03:09:21,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-28 03:09:21,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-28 03:09:21,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-28 03:09:21,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-28 03:09:21,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-28 03:09:21,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-28 03:09:21,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-28 03:09:21,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-28 03:09:21,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 03:09:21,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:09:42,025 WARN L232 SmtUtils]: Spent 20.26s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 03:10:02,102 WARN L232 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 03:11:01,654 WARN L232 SmtUtils]: Spent 59.22s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 03:17:24,612 WARN L232 SmtUtils]: Spent 6.38m on a formula simplification that was a NOOP. DAG size: 143 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 03:17:36,381 WARN L232 SmtUtils]: Spent 10.28s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 03:18:09,278 WARN L232 SmtUtils]: Spent 31.38s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 03:18:14,554 WARN L232 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 03:19:13,555 WARN L232 SmtUtils]: Spent 56.31s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 03:20:50,675 WARN L232 SmtUtils]: Spent 1.61m on a formula simplification that was a NOOP. DAG size: 140 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)