/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.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-27 10:44:49,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:44:49,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:44:49,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:44:49,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:44:49,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:44:49,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:44:49,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:44:49,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:44:49,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:44:49,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:44:49,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:44:49,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:44:49,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:44:49,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:44:49,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:44:49,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:44:49,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:44:49,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:44:49,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:44:49,332 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:44:49,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:44:49,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:44:49,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:44:49,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:44:49,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:44:49,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:44:49,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:44:49,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:44:49,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:44:49,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:44:49,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:44:49,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:44:49,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:44:49,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:44:49,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:44:49,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:44:49,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:44:49,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:44:49,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:44:49,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:44:49,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:44:49,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:44:49,366 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:44:49,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:44:49,367 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:44:49,367 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:44:49,367 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:44:49,368 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:44:49,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:44:49,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:44:49,368 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:44:49,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:44:49,369 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:44:49,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:44:49,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:44:49,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:44:49,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:44:49,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:44:49,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:44:49,370 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:44:49,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:44:49,370 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:44:49,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:44:49,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:44:49,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:44:49,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:44:49,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:44:49,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:44:49,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:44:49,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:44:49,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:44:49,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:44:49,372 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:44:49,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:44:49,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:44:49,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:44:49,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:44:49,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:44:49,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:44:49,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:44:49,598 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:44:49,599 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-27 10:44:49,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063ba841b/1458431e704a477895e7ab24d858779c/FLAGe1b5ab802 [2022-04-27 10:44:49,972 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:44:49,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2022-04-27 10:44:49,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063ba841b/1458431e704a477895e7ab24d858779c/FLAGe1b5ab802 [2022-04-27 10:44:50,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063ba841b/1458431e704a477895e7ab24d858779c [2022-04-27 10:44:50,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:44:50,397 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:44:50,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:44:50,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:44:50,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:44:50,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:44:50" (1/1) ... [2022-04-27 10:44:50,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca1abce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:50, skipping insertion in model container [2022-04-27 10:44:50,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:44:50" (1/1) ... [2022-04-27 10:44:50,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:44:50,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:44:50,582 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-27 10:44:50,586 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-27 10:44:50,588 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-27 10:44:50,589 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-27 10:44:50,590 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-27 10:44:50,592 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-27 10:44:50,594 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-27 10:44:50,595 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-27 10:44:50,597 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-27 10:44:50,598 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-27 10:44:50,600 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-27 10:44:50,601 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-27 10:44:50,602 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-27 10:44:50,603 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-27 10:44:50,605 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-27 10:44:50,606 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-27 10:44:50,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:44:50,615 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:44:50,627 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-27 10:44:50,628 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-27 10:44:50,630 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-27 10:44:50,631 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-27 10:44:50,632 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-27 10:44:50,633 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-27 10:44:50,635 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-27 10:44:50,636 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-27 10:44:50,637 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-27 10:44:50,638 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-27 10:44:50,639 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-27 10:44:50,640 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-27 10:44:50,641 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-27 10:44:50,642 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-27 10:44:50,654 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-27 10:44:50,655 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-27 10:44:50,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:44:50,676 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:44:50,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:50 WrapperNode [2022-04-27 10:44:50,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:44:50,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:44:50,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:44:50,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:44:50,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:50" (1/1) ... [2022-04-27 10:44:50,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:50" (1/1) ... [2022-04-27 10:44:50,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:50" (1/1) ... [2022-04-27 10:44:50,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:50" (1/1) ... [2022-04-27 10:44:50,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:50" (1/1) ... [2022-04-27 10:44:50,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:50" (1/1) ... [2022-04-27 10:44:50,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:50" (1/1) ... [2022-04-27 10:44:50,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:44:50,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:44:50,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:44:50,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:44:50,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:50" (1/1) ... [2022-04-27 10:44:50,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:44:50,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:44:50,768 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-27 10:44:50,793 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-27 10:44:50,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:44:50,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:44:50,810 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:44:50,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:44:50,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:44:50,810 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:44:50,810 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:44:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:44:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:44:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:44:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:44:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:44:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:44:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:44:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:44:50,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:44:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:44:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:44:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:44:50,867 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:44:50,869 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:44:51,070 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:44:51,076 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:44:51,076 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 10:44:51,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:44:51 BoogieIcfgContainer [2022-04-27 10:44:51,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:44:51,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:44:51,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:44:51,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:44:51,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:44:50" (1/3) ... [2022-04-27 10:44:51,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a2d522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:44:51, skipping insertion in model container [2022-04-27 10:44:51,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:44:50" (2/3) ... [2022-04-27 10:44:51,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a2d522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:44:51, skipping insertion in model container [2022-04-27 10:44:51,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:44:51" (3/3) ... [2022-04-27 10:44:51,088 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2022-04-27 10:44:51,099 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:44:51,101 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-27 10:44:51,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:44:51,176 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@2119115, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a05ed4c [2022-04-27 10:44:51,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-27 10:44:51,188 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-27 10:44:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:44:51,194 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:51,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:51,195 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-27 10:44:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash -189701311, now seen corresponding path program 1 times [2022-04-27 10:44:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:51,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897740675] [2022-04-27 10:44:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:51,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:51,452 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-27 10:44:51,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {68#true} assume true; {68#true} is VALID [2022-04-27 10:44:51,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68#true} {68#true} #149#return; {68#true} is VALID [2022-04-27 10:44:51,454 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-27 10:44:51,455 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-27 10:44:51,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2022-04-27 10:44:51,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #149#return; {68#true} is VALID [2022-04-27 10:44:51,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret7 := main(); {68#true} is VALID [2022-04-27 10:44:51,455 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-27 10:44:51,456 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-27 10:44:51,456 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-27 10:44:51,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {68#true} assume ~main__i~0 < ~main__len~0; {68#true} is VALID [2022-04-27 10:44:51,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#true} assume ~main__j~0 < ~main__limit~0; {68#true} is VALID [2022-04-27 10:44:51,457 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-27 10:44:51,458 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-27 10:44:51,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {69#false} assume !false; {69#false} is VALID [2022-04-27 10:44:51,458 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-27 10:44:51,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:51,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897740675] [2022-04-27 10:44:51,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897740675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:51,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:51,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:44:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954953361] [2022-04-27 10:44:51,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:51,466 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-27 10:44:51,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:51,470 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-27 10:44:51,492 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-27 10:44:51,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:44:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:51,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:44:51,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:44:51,514 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-27 10:44:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:51,766 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2022-04-27 10:44:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:44:51,766 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-27 10:44:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:51,773 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-27 10:44:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-04-27 10:44:51,787 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-27 10:44:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-04-27 10:44:51,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 118 transitions. [2022-04-27 10:44:51,915 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-27 10:44:51,929 INFO L225 Difference]: With dead ends: 90 [2022-04-27 10:44:51,929 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 10:44:51,932 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-27 10:44:51,935 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-27 10:44:51,936 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-27 10:44:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 10:44:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2022-04-27 10:44:51,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:51,965 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-27 10:44:51,966 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-27 10:44:51,967 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-27 10:44:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:51,972 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-27 10:44:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-27 10:44:51,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:51,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:51,973 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-27 10:44:51,973 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-27 10:44:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:51,978 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-27 10:44:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-27 10:44:51,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:51,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:51,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:51,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:51,980 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-27 10:44:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-27 10:44:51,983 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2022-04-27 10:44:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:51,983 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-27 10:44:51,983 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-27 10:44:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-27 10:44:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:44:51,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:51,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:51,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:44:51,985 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-27 10:44:51,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:51,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1582601500, now seen corresponding path program 1 times [2022-04-27 10:44:51,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:51,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724886267] [2022-04-27 10:44:51,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:51,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:52,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:52,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#(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; {398#true} is VALID [2022-04-27 10:44:52,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} assume true; {398#true} is VALID [2022-04-27 10:44:52,054 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {398#true} {398#true} #149#return; {398#true} is VALID [2022-04-27 10:44:52,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {398#true} call ULTIMATE.init(); {405#(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-27 10:44:52,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#(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; {398#true} is VALID [2022-04-27 10:44:52,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} assume true; {398#true} is VALID [2022-04-27 10:44:52,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} #149#return; {398#true} is VALID [2022-04-27 10:44:52,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#true} call #t~ret7 := main(); {398#true} is VALID [2022-04-27 10:44:52,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#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; {398#true} is VALID [2022-04-27 10:44:52,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#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; {398#true} is VALID [2022-04-27 10:44:52,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {398#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {403#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 10:44:52,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {403#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__i~0 < ~main__len~0; {403#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 10:44:52,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {403#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__j~0 < ~main__limit~0; {403#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 10:44:52,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {403#(not (<= main_~main__len~0 main_~main__i~0))} assume !(1 + ~main__i~0 < ~main__len~0); {403#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 10:44:52,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {403#(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; {404#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-27 10:44:52,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {404#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {399#false} is VALID [2022-04-27 10:44:52,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {399#false} assume !false; {399#false} is VALID [2022-04-27 10:44:52,059 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-27 10:44:52,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:52,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724886267] [2022-04-27 10:44:52,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724886267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:52,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:52,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:44:52,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129656306] [2022-04-27 10:44:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:52,061 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-27 10:44:52,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:52,062 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-27 10:44:52,073 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-27 10:44:52,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:44:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:52,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:44:52,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:44:52,075 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-27 10:44:52,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:52,463 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2022-04-27 10:44:52,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:44:52,463 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-27 10:44:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:52,464 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-27 10:44:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2022-04-27 10:44:52,467 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-27 10:44:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2022-04-27 10:44:52,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 168 transitions. [2022-04-27 10:44:52,648 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-27 10:44:52,651 INFO L225 Difference]: With dead ends: 153 [2022-04-27 10:44:52,651 INFO L226 Difference]: Without dead ends: 101 [2022-04-27 10:44:52,652 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-27 10:44:52,654 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-27 10:44:52,654 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-27 10:44:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-27 10:44:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2022-04-27 10:44:52,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:52,670 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-27 10:44:52,670 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-27 10:44:52,671 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-27 10:44:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:52,675 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-04-27 10:44:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-04-27 10:44:52,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:52,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:52,684 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-27 10:44:52,684 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-27 10:44:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:52,688 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-04-27 10:44:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-04-27 10:44:52,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:52,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:52,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:52,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:52,691 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-27 10:44:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-27 10:44:52,695 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2022-04-27 10:44:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:52,696 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-27 10:44:52,696 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-27 10:44:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-27 10:44:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:44:52,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:52,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:52,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:44:52,700 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-27 10:44:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:52,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1585770269, now seen corresponding path program 1 times [2022-04-27 10:44:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:52,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317539816] [2022-04-27 10:44:52,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:52,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:52,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {859#(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; {852#true} is VALID [2022-04-27 10:44:52,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#true} assume true; {852#true} is VALID [2022-04-27 10:44:52,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {852#true} {852#true} #149#return; {852#true} is VALID [2022-04-27 10:44:52,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {852#true} call ULTIMATE.init(); {859#(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-27 10:44:52,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {859#(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; {852#true} is VALID [2022-04-27 10:44:52,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {852#true} assume true; {852#true} is VALID [2022-04-27 10:44:52,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {852#true} {852#true} #149#return; {852#true} is VALID [2022-04-27 10:44:52,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {852#true} call #t~ret7 := main(); {852#true} is VALID [2022-04-27 10:44:52,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {852#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; {852#true} is VALID [2022-04-27 10:44:52,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {852#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; {857#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:52,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {857#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:52,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {857#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {857#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:52,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {857#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {857#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:52,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {857#(<= 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; {857#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:52,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {857#(<= 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; {858#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 10:44:52,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {853#false} is VALID [2022-04-27 10:44:52,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#false} assume !false; {853#false} is VALID [2022-04-27 10:44:52,824 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-27 10:44:52,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:52,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317539816] [2022-04-27 10:44:52,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317539816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:52,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:52,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:44:52,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821058046] [2022-04-27 10:44:52,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:52,825 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-27 10:44:52,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:52,825 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-27 10:44:52,836 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-27 10:44:52,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:44:52,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:52,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:44:52,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:44:52,838 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-27 10:44:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:53,034 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-27 10:44:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:44:53,035 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-27 10:44:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:53,035 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-27 10:44:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-04-27 10:44:53,037 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-27 10:44:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-04-27 10:44:53,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2022-04-27 10:44:53,108 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-27 10:44:53,110 INFO L225 Difference]: With dead ends: 75 [2022-04-27 10:44:53,110 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 10:44:53,110 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-27 10:44:53,112 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-27 10:44:53,112 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-27 10:44:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 10:44:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2022-04-27 10:44:53,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:53,120 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-27 10:44:53,121 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-27 10:44:53,121 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-27 10:44:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:53,123 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-27 10:44:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-27 10:44:53,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:53,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:53,124 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-27 10:44:53,124 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-27 10:44:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:53,126 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-27 10:44:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-27 10:44:53,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:53,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:53,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:53,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:53,127 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-27 10:44:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-27 10:44:53,129 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2022-04-27 10:44:53,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:53,129 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-27 10:44:53,129 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-27 10:44:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-27 10:44:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:44:53,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:53,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:53,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:44:53,130 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-27 10:44:53,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:53,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1816003151, now seen corresponding path program 1 times [2022-04-27 10:44:53,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:53,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767390016] [2022-04-27 10:44:53,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:53,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:53,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:53,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {1170#(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; {1163#true} is VALID [2022-04-27 10:44:53,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {1163#true} assume true; {1163#true} is VALID [2022-04-27 10:44:53,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1163#true} {1163#true} #149#return; {1163#true} is VALID [2022-04-27 10:44:53,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {1163#true} call ULTIMATE.init(); {1170#(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-27 10:44:53,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#(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; {1163#true} is VALID [2022-04-27 10:44:53,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {1163#true} assume true; {1163#true} is VALID [2022-04-27 10:44:53,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1163#true} {1163#true} #149#return; {1163#true} is VALID [2022-04-27 10:44:53,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {1163#true} call #t~ret7 := main(); {1163#true} is VALID [2022-04-27 10:44:53,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {1163#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; {1163#true} is VALID [2022-04-27 10:44:53,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {1163#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; {1168#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:53,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {1168#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1168#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:53,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {1168#(<= 0 main_~main__i~0)} assume ~main__i~0 < ~main__len~0; {1168#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:53,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {1168#(<= 0 main_~main__i~0)} assume ~main__j~0 < ~main__limit~0; {1168#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:53,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {1168#(<= 0 main_~main__i~0)} assume !(1 + ~main__i~0 < ~main__len~0); {1168#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:53,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {1168#(<= 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; {1168#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:53,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {1168#(<= 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; {1169#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-27 10:44:53,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {1169#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {1164#false} is VALID [2022-04-27 10:44:53,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {1164#false} assume !false; {1164#false} is VALID [2022-04-27 10:44:53,206 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-27 10:44:53,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:53,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767390016] [2022-04-27 10:44:53,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767390016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:53,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:53,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:44:53,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153255203] [2022-04-27 10:44:53,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:53,207 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-27 10:44:53,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:53,208 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-27 10:44:53,218 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-27 10:44:53,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:44:53,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:44:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:44:53,219 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-27 10:44:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:53,448 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-27 10:44:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:44:53,449 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-27 10:44:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:53,449 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-27 10:44:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-04-27 10:44:53,451 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-27 10:44:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-04-27 10:44:53,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2022-04-27 10:44:53,555 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-27 10:44:53,557 INFO L225 Difference]: With dead ends: 96 [2022-04-27 10:44:53,557 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 10:44:53,557 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-27 10:44:53,558 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-27 10:44:53,558 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-27 10:44:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 10:44:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2022-04-27 10:44:53,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:53,572 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-27 10:44:53,573 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-27 10:44:53,573 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-27 10:44:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:53,576 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-27 10:44:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-27 10:44:53,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:53,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:53,576 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-27 10:44:53,577 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-27 10:44:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:53,579 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-27 10:44:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-27 10:44:53,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:53,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:53,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:53,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:53,580 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-27 10:44:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-27 10:44:53,581 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2022-04-27 10:44:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:53,582 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-27 10:44:53,582 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-27 10:44:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 10:44:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:44:53,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:53,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:53,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:44:53,589 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-27 10:44:53,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash -461519734, now seen corresponding path program 1 times [2022-04-27 10:44:53,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:53,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146353735] [2022-04-27 10:44:53,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:53,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:53,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {1543#(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; {1535#true} is VALID [2022-04-27 10:44:53,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-27 10:44:53,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1535#true} {1535#true} #149#return; {1535#true} is VALID [2022-04-27 10:44:53,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {1535#true} call ULTIMATE.init(); {1543#(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-27 10:44:53,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {1543#(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; {1535#true} is VALID [2022-04-27 10:44:53,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-27 10:44:53,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #149#return; {1535#true} is VALID [2022-04-27 10:44:53,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret7 := main(); {1535#true} is VALID [2022-04-27 10:44:53,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {1535#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; {1535#true} is VALID [2022-04-27 10:44:53,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {1535#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; {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:53,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:53,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:53,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {1540#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {1541#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:53,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {1541#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} assume !(1 + ~main__i~0 < ~main__len~0); {1541#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:53,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {1541#(<= (+ 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; {1541#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:53,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {1541#(<= (+ 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; {1541#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:53,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {1541#(<= (+ 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; {1542#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 10:44:53,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {1542#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {1536#false} is VALID [2022-04-27 10:44:53,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2022-04-27 10:44:53,675 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-27 10:44:53,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:53,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146353735] [2022-04-27 10:44:53,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146353735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:53,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:53,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:44:53,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208178626] [2022-04-27 10:44:53,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:53,677 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-27 10:44:53,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:53,677 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-27 10:44:53,690 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-27 10:44:53,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:44:53,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:53,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:44:53,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:44:53,693 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-27 10:44:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:54,065 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-04-27 10:44:54,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:44:54,066 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-27 10:44:54,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:54,066 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-27 10:44:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-27 10:44:54,068 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-27 10:44:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-27 10:44:54,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-27 10:44:54,170 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-27 10:44:54,171 INFO L225 Difference]: With dead ends: 95 [2022-04-27 10:44:54,171 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 10:44:54,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:44:54,172 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-27 10:44:54,173 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-27 10:44:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 10:44:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2022-04-27 10:44:54,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:54,185 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-27 10:44:54,185 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-27 10:44:54,185 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-27 10:44:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:54,188 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-27 10:44:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-27 10:44:54,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:54,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:54,188 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-27 10:44:54,188 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-27 10:44:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:54,191 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-04-27 10:44:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-04-27 10:44:54,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:54,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:54,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:54,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:54,191 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-27 10:44:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-27 10:44:54,193 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2022-04-27 10:44:54,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:54,193 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-27 10:44:54,193 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-27 10:44:54,193 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-27 10:44:54,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:44:54,194 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:54,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:54,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:44:54,194 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-27 10:44:54,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash 788286019, now seen corresponding path program 1 times [2022-04-27 10:44:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:54,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737238737] [2022-04-27 10:44:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:54,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:54,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {1914#(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; {1907#true} is VALID [2022-04-27 10:44:54,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-04-27 10:44:54,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1907#true} {1907#true} #149#return; {1907#true} is VALID [2022-04-27 10:44:54,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {1907#true} call ULTIMATE.init(); {1914#(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-27 10:44:54,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {1914#(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; {1907#true} is VALID [2022-04-27 10:44:54,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2022-04-27 10:44:54,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #149#return; {1907#true} is VALID [2022-04-27 10:44:54,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {1907#true} call #t~ret7 := main(); {1907#true} is VALID [2022-04-27 10:44:54,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {1907#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; {1907#true} is VALID [2022-04-27 10:44:54,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {1907#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; {1907#true} is VALID [2022-04-27 10:44:54,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {1907#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {1912#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 10:44:54,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {1912#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__i~0 < ~main__len~0; {1912#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 10:44:54,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(not (<= main_~main__len~0 main_~main__i~0))} assume ~main__j~0 < ~main__limit~0; {1912#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 10:44:54,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {1912#(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; {1912#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 10:44:54,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {1912#(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; {1912#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 10:44:54,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {1912#(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; {1912#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 10:44:54,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {1912#(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; {1913#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-27 10:44:54,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {1913#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {1908#false} is VALID [2022-04-27 10:44:54,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2022-04-27 10:44:54,252 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-27 10:44:54,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:54,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737238737] [2022-04-27 10:44:54,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737238737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:54,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:54,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:44:54,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945004421] [2022-04-27 10:44:54,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:54,253 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-27 10:44:54,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:54,253 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-27 10:44:54,263 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-27 10:44:54,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:44:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:54,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:44:54,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:44:54,264 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-27 10:44:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:54,468 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-27 10:44:54,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:44:54,468 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-27 10:44:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:54,468 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-27 10:44:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-04-27 10:44:54,470 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-27 10:44:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-04-27 10:44:54,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2022-04-27 10:44:54,536 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-27 10:44:54,537 INFO L225 Difference]: With dead ends: 69 [2022-04-27 10:44:54,537 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 10:44:54,537 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-27 10:44:54,538 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 109 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:44:54,538 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.1s Time] [2022-04-27 10:44:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 10:44:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2022-04-27 10:44:54,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:54,549 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-27 10:44:54,549 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-27 10:44:54,549 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-27 10:44:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:54,550 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-27 10:44:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-27 10:44:54,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:54,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:54,550 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-27 10:44:54,551 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-27 10:44:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:54,552 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-27 10:44:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-27 10:44:54,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:54,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:54,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:54,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:54,553 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-27 10:44:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-27 10:44:54,554 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2022-04-27 10:44:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:54,554 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-27 10:44:54,554 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-27 10:44:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-27 10:44:54,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:44:54,555 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:54,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:54,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:44:54,555 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-27 10:44:54,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:54,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1422206761, now seen corresponding path program 1 times [2022-04-27 10:44:54,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:54,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117086191] [2022-04-27 10:44:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:54,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:54,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:54,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {2205#(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; {2198#true} is VALID [2022-04-27 10:44:54,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {2198#true} assume true; {2198#true} is VALID [2022-04-27 10:44:54,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2198#true} {2198#true} #149#return; {2198#true} is VALID [2022-04-27 10:44:54,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {2198#true} call ULTIMATE.init(); {2205#(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-27 10:44:54,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {2205#(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; {2198#true} is VALID [2022-04-27 10:44:54,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2022-04-27 10:44:54,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #149#return; {2198#true} is VALID [2022-04-27 10:44:54,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret7 := main(); {2198#true} is VALID [2022-04-27 10:44:54,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {2198#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; {2198#true} is VALID [2022-04-27 10:44:54,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {2198#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; {2198#true} is VALID [2022-04-27 10:44:54,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {2198#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2203#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:54,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {2203#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {2203#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:54,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {2203#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {2203#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:54,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {2203#(<= 0 main_~main__j~0)} assume !(1 + ~main__i~0 < ~main__len~0); {2203#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:54,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {2203#(<= 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; {2203#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:54,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {2203#(<= 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; {2203#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:54,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {2203#(<= 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; {2203#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:54,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#(<= 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; {2204#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 10:44:54,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {2204#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {2199#false} is VALID [2022-04-27 10:44:54,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2022-04-27 10:44:54,618 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-27 10:44:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:54,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117086191] [2022-04-27 10:44:54,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117086191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:54,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:54,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:44:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240661224] [2022-04-27 10:44:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:54,619 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-27 10:44:54,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:54,620 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-27 10:44:54,634 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-27 10:44:54,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:44:54,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:54,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:44:54,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:44:54,635 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-27 10:44:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:54,868 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-04-27 10:44:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:44:54,868 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-27 10:44:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:54,868 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-27 10:44:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-04-27 10:44:54,870 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-27 10:44:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-04-27 10:44:54,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 97 transitions. [2022-04-27 10:44:54,963 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-27 10:44:54,964 INFO L225 Difference]: With dead ends: 91 [2022-04-27 10:44:54,964 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 10:44:54,964 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-27 10:44:54,965 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-27 10:44:54,965 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-27 10:44:54,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 10:44:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2022-04-27 10:44:54,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:54,984 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-27 10:44:54,984 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-27 10:44:54,985 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-27 10:44:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:54,986 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-27 10:44:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-27 10:44:54,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:54,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:54,987 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-27 10:44:54,987 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-27 10:44:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:54,989 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-27 10:44:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-27 10:44:54,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:54,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:54,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:54,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:54,989 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-27 10:44:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-27 10:44:54,991 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2022-04-27 10:44:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:54,991 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-27 10:44:54,991 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-27 10:44:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-27 10:44:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:44:54,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:54,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:44:54,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 10:44:54,992 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-27 10:44:54,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:54,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1332934067, now seen corresponding path program 1 times [2022-04-27 10:44:54,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:54,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495749120] [2022-04-27 10:44:54,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:55,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:55,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {2558#(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; {2550#true} is VALID [2022-04-27 10:44:55,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 10:44:55,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2550#true} {2550#true} #149#return; {2550#true} is VALID [2022-04-27 10:44:55,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2558#(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-27 10:44:55,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#(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; {2550#true} is VALID [2022-04-27 10:44:55,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 10:44:55,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #149#return; {2550#true} is VALID [2022-04-27 10:44:55,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret7 := main(); {2550#true} is VALID [2022-04-27 10:44:55,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#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; {2550#true} is VALID [2022-04-27 10:44:55,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {2550#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; {2550#true} is VALID [2022-04-27 10:44:55,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {2550#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2550#true} is VALID [2022-04-27 10:44:55,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {2550#true} assume ~main__i~0 < ~main__len~0; {2550#true} is VALID [2022-04-27 10:44:55,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {2550#true} assume ~main__j~0 < ~main__limit~0; {2550#true} is VALID [2022-04-27 10:44:55,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {2550#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; {2550#true} is VALID [2022-04-27 10:44:55,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {2550#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; {2555#(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-27 10:44:55,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {2555#(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; {2556#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:55,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {2556#(<= 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; {2556#(<= 0 main_~main__i~0)} is VALID [2022-04-27 10:44:55,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {2556#(<= 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; {2557#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 10:44:55,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {2557#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {2551#false} is VALID [2022-04-27 10:44:55,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-27 10:44:55,079 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-27 10:44:55,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:55,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495749120] [2022-04-27 10:44:55,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495749120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:55,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:55,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:44:55,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936715705] [2022-04-27 10:44:55,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:55,080 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-27 10:44:55,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:55,081 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-27 10:44:55,092 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-27 10:44:55,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:44:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:55,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:44:55,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:44:55,093 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-27 10:44:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:55,420 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-04-27 10:44:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:44:55,420 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-27 10:44:55,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:55,421 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-27 10:44:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-04-27 10:44:55,422 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-27 10:44:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-04-27 10:44:55,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2022-04-27 10:44:55,499 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-27 10:44:55,500 INFO L225 Difference]: With dead ends: 73 [2022-04-27 10:44:55,500 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 10:44:55,500 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-27 10:44:55,501 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-27 10:44:55,501 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-27 10:44:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 10:44:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2022-04-27 10:44:55,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:55,515 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-27 10:44:55,515 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-27 10:44:55,515 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-27 10:44:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:55,517 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-04-27 10:44:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-27 10:44:55,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:55,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:55,517 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-27 10:44:55,518 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-27 10:44:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:55,519 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-04-27 10:44:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-27 10:44:55,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:55,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:55,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:55,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:55,520 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-27 10:44:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-27 10:44:55,521 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2022-04-27 10:44:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:55,521 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-27 10:44:55,521 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-27 10:44:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-27 10:44:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:44:55,522 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:55,522 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-27 10:44:55,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 10:44:55,522 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-27 10:44:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:55,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1628720009, now seen corresponding path program 1 times [2022-04-27 10:44:55,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:55,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650352614] [2022-04-27 10:44:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:55,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:55,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {2863#(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; {2855#true} is VALID [2022-04-27 10:44:55,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {2855#true} assume true; {2855#true} is VALID [2022-04-27 10:44:55,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2855#true} {2855#true} #149#return; {2855#true} is VALID [2022-04-27 10:44:55,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {2855#true} call ULTIMATE.init(); {2863#(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-27 10:44:55,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {2863#(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; {2855#true} is VALID [2022-04-27 10:44:55,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {2855#true} assume true; {2855#true} is VALID [2022-04-27 10:44:55,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2855#true} {2855#true} #149#return; {2855#true} is VALID [2022-04-27 10:44:55,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {2855#true} call #t~ret7 := main(); {2855#true} is VALID [2022-04-27 10:44:55,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {2855#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; {2855#true} is VALID [2022-04-27 10:44:55,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {2855#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; {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:55,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:55,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:55,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {2860#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {2861#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:55,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {2861#(<= (+ 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; {2861#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:55,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {2861#(<= (+ 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; {2861#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:55,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {2861#(<= (+ 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; {2861#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:55,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {2861#(<= (+ 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; {2861#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:55,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {2861#(<= (+ 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; {2861#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:55,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {2861#(<= (+ 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; {2862#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-27 10:44:55,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {2862#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {2856#false} is VALID [2022-04-27 10:44:55,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {2856#false} assume !false; {2856#false} is VALID [2022-04-27 10:44:55,586 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-27 10:44:55,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:55,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650352614] [2022-04-27 10:44:55,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650352614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:55,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:55,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:44:55,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466329667] [2022-04-27 10:44:55,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:55,588 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-27 10:44:55,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:55,588 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-27 10:44:55,600 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-27 10:44:55,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:44:55,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:55,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:44:55,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:44:55,601 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-27 10:44:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:55,853 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-27 10:44:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:44:55,853 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-27 10:44:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:55,853 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-27 10:44:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 10:44:55,854 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-27 10:44:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 10:44:55,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-27 10:44:55,925 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-27 10:44:55,925 INFO L225 Difference]: With dead ends: 61 [2022-04-27 10:44:55,926 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 10:44:55,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:44:55,926 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-27 10:44:55,927 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-27 10:44:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 10:44:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-04-27 10:44:55,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:55,939 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-27 10:44:55,939 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-27 10:44:55,939 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-27 10:44:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:55,941 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 10:44:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 10:44:55,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:55,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:55,942 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-27 10:44:55,942 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-27 10:44:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:55,943 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 10:44:55,943 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 10:44:55,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:55,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:55,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:55,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:55,944 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-27 10:44:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-27 10:44:55,944 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2022-04-27 10:44:55,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:55,945 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-27 10:44:55,945 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-27 10:44:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-27 10:44:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:44:55,945 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:55,945 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-27 10:44:55,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 10:44:55,946 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-27 10:44:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:55,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1049284141, now seen corresponding path program 1 times [2022-04-27 10:44:55,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:55,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875459676] [2022-04-27 10:44:55,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:56,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {3124#(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; {3117#true} is VALID [2022-04-27 10:44:56,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {3117#true} assume true; {3117#true} is VALID [2022-04-27 10:44:56,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3117#true} {3117#true} #149#return; {3117#true} is VALID [2022-04-27 10:44:56,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {3117#true} call ULTIMATE.init(); {3124#(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-27 10:44:56,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {3124#(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; {3117#true} is VALID [2022-04-27 10:44:56,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {3117#true} assume true; {3117#true} is VALID [2022-04-27 10:44:56,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3117#true} {3117#true} #149#return; {3117#true} is VALID [2022-04-27 10:44:56,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {3117#true} call #t~ret7 := main(); {3117#true} is VALID [2022-04-27 10:44:56,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {3117#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; {3117#true} is VALID [2022-04-27 10:44:56,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {3117#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; {3117#true} is VALID [2022-04-27 10:44:56,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {3117#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3122#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:56,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {3122#(<= 0 main_~main__j~0)} assume ~main__i~0 < ~main__len~0; {3122#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:56,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {3122#(<= 0 main_~main__j~0)} assume ~main__j~0 < ~main__limit~0; {3122#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:56,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {3122#(<= 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; {3122#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:56,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {3122#(<= 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; {3122#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:56,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {3122#(<= 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; {3122#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:56,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {3122#(<= 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; {3122#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:56,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {3122#(<= 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; {3122#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:56,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {3122#(<= 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; {3122#(<= 0 main_~main__j~0)} is VALID [2022-04-27 10:44:56,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {3122#(<= 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; {3123#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 10:44:56,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {3123#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {3118#false} is VALID [2022-04-27 10:44:56,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {3118#false} assume !false; {3118#false} is VALID [2022-04-27 10:44:56,013 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-27 10:44:56,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:56,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875459676] [2022-04-27 10:44:56,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875459676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:56,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:56,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:44:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762160205] [2022-04-27 10:44:56,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:56,014 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-27 10:44:56,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:56,014 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-27 10:44:56,026 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-27 10:44:56,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:44:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:44:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:44:56,027 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-27 10:44:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:56,189 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-27 10:44:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:44:56,189 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-27 10:44:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:56,190 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-27 10:44:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 10:44:56,191 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-27 10:44:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 10:44:56,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 10:44:56,254 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-27 10:44:56,254 INFO L225 Difference]: With dead ends: 61 [2022-04-27 10:44:56,255 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 10:44:56,255 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-27 10:44:56,255 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-27 10:44:56,255 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-27 10:44:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 10:44:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2022-04-27 10:44:56,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:56,271 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-27 10:44:56,271 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-27 10:44:56,271 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-27 10:44:56,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:56,272 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 10:44:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 10:44:56,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:56,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:56,273 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-27 10:44:56,273 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-27 10:44:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:56,274 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 10:44:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 10:44:56,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:56,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:56,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:56,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:56,275 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-27 10:44:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-27 10:44:56,276 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2022-04-27 10:44:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:56,276 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-27 10:44:56,276 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-27 10:44:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 10:44:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:44:56,276 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:56,277 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-27 10:44:56,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 10:44:56,277 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-27 10:44:56,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:56,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1831933135, now seen corresponding path program 1 times [2022-04-27 10:44:56,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:56,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370969738] [2022-04-27 10:44:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:56,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:56,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:56,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {3380#(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; {3373#true} is VALID [2022-04-27 10:44:56,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {3373#true} assume true; {3373#true} is VALID [2022-04-27 10:44:56,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3373#true} {3373#true} #149#return; {3373#true} is VALID [2022-04-27 10:44:56,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {3373#true} call ULTIMATE.init(); {3380#(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-27 10:44:56,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {3380#(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; {3373#true} is VALID [2022-04-27 10:44:56,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {3373#true} assume true; {3373#true} is VALID [2022-04-27 10:44:56,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3373#true} {3373#true} #149#return; {3373#true} is VALID [2022-04-27 10:44:56,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {3373#true} call #t~ret7 := main(); {3373#true} is VALID [2022-04-27 10:44:56,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {3373#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; {3373#true} is VALID [2022-04-27 10:44:56,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {3373#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; {3373#true} is VALID [2022-04-27 10:44:56,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {3373#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3373#true} is VALID [2022-04-27 10:44:56,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {3373#true} assume ~main__i~0 < ~main__len~0; {3373#true} is VALID [2022-04-27 10:44:56,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {3373#true} assume ~main__j~0 < ~main__limit~0; {3373#true} is VALID [2022-04-27 10:44:56,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {3373#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; {3378#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 10:44:56,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {3378#(<= (+ 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; {3378#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 10:44:56,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {3378#(<= (+ 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; {3378#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 10:44:56,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {3378#(<= (+ 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; {3378#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 10:44:56,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {3378#(<= (+ 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; {3378#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 10:44:56,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {3378#(<= (+ 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; {3378#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 10:44:56,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {3378#(<= (+ 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; {3378#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 10:44:56,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {3378#(<= (+ 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; {3379#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 10:44:56,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {3379#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {3374#false} is VALID [2022-04-27 10:44:56,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {3374#false} assume !false; {3374#false} is VALID [2022-04-27 10:44:56,340 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-27 10:44:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:56,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370969738] [2022-04-27 10:44:56,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370969738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:56,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:56,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:44:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11987695] [2022-04-27 10:44:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:56,342 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-27 10:44:56,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:56,342 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-27 10:44:56,367 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-27 10:44:56,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:44:56,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:56,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:44:56,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:44:56,368 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-27 10:44:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:56,602 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-27 10:44:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:44:56,602 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-27 10:44:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:56,602 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-27 10:44:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 10:44:56,603 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-27 10:44:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 10:44:56,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-27 10:44:56,675 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-27 10:44:56,676 INFO L225 Difference]: With dead ends: 69 [2022-04-27 10:44:56,676 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 10:44:56,676 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-27 10:44:56,677 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-27 10:44:56,677 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-27 10:44:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 10:44:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2022-04-27 10:44:56,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:56,702 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-27 10:44:56,703 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-27 10:44:56,703 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-27 10:44:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:56,704 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-27 10:44:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-27 10:44:56,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:56,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:56,704 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-27 10:44:56,705 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-27 10:44:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:56,706 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-27 10:44:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-27 10:44:56,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:56,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:56,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:56,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:56,706 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-27 10:44:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-27 10:44:56,707 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2022-04-27 10:44:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:56,707 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-27 10:44:56,707 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-27 10:44:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-27 10:44:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:44:56,708 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:56,708 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-27 10:44:56,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 10:44:56,708 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-27 10:44:56,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:56,709 INFO L85 PathProgramCache]: Analyzing trace with hash 955355481, now seen corresponding path program 1 times [2022-04-27 10:44:56,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:56,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613681707] [2022-04-27 10:44:56,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:56,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:56,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {3663#(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; {3655#true} is VALID [2022-04-27 10:44:56,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {3655#true} assume true; {3655#true} is VALID [2022-04-27 10:44:56,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3655#true} {3655#true} #149#return; {3655#true} is VALID [2022-04-27 10:44:56,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {3655#true} call ULTIMATE.init(); {3663#(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-27 10:44:56,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {3663#(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; {3655#true} is VALID [2022-04-27 10:44:56,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {3655#true} assume true; {3655#true} is VALID [2022-04-27 10:44:56,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3655#true} {3655#true} #149#return; {3655#true} is VALID [2022-04-27 10:44:56,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {3655#true} call #t~ret7 := main(); {3655#true} is VALID [2022-04-27 10:44:56,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {3655#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; {3655#true} is VALID [2022-04-27 10:44:56,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {3655#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; {3660#(= main_~main__i~0 0)} is VALID [2022-04-27 10:44:56,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {3660#(= main_~main__i~0 0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3660#(= main_~main__i~0 0)} is VALID [2022-04-27 10:44:56,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {3660#(= main_~main__i~0 0)} assume ~main__i~0 < ~main__len~0; {3660#(= main_~main__i~0 0)} is VALID [2022-04-27 10:44:56,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {3660#(= main_~main__i~0 0)} assume ~main__j~0 < ~main__limit~0; {3660#(= main_~main__i~0 0)} is VALID [2022-04-27 10:44:56,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {3660#(= 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; {3660#(= main_~main__i~0 0)} is VALID [2022-04-27 10:44:56,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {3660#(= 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; {3660#(= main_~main__i~0 0)} is VALID [2022-04-27 10:44:56,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {3660#(= 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; {3660#(= main_~main__i~0 0)} is VALID [2022-04-27 10:44:56,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {3660#(= 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; {3660#(= main_~main__i~0 0)} is VALID [2022-04-27 10:44:56,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {3660#(= 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; {3660#(= main_~main__i~0 0)} is VALID [2022-04-27 10:44:56,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {3660#(= 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; {3660#(= main_~main__i~0 0)} is VALID [2022-04-27 10:44:56,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {3660#(= 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; {3660#(= main_~main__i~0 0)} is VALID [2022-04-27 10:44:56,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {3660#(= 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; {3661#(<= 1 main_~main__i~0)} is VALID [2022-04-27 10:44:56,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {3661#(<= 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; {3662#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 10:44:56,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {3662#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {3656#false} is VALID [2022-04-27 10:44:56,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {3656#false} assume !false; {3656#false} is VALID [2022-04-27 10:44:56,761 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-27 10:44:56,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:56,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613681707] [2022-04-27 10:44:56,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613681707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:56,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:56,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:44:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935770383] [2022-04-27 10:44:56,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:56,762 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-27 10:44:56,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:56,762 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-27 10:44:56,776 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-27 10:44:56,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:44:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:56,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:44:56,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:44:56,777 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-27 10:44:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:57,101 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-27 10:44:57,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:44:57,101 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-27 10:44:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:57,102 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-27 10:44:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 10:44:57,103 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-27 10:44:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 10:44:57,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2022-04-27 10:44:57,170 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-27 10:44:57,171 INFO L225 Difference]: With dead ends: 74 [2022-04-27 10:44:57,171 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 10:44:57,172 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-27 10:44:57,174 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-27 10:44:57,174 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-27 10:44:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 10:44:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2022-04-27 10:44:57,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:57,192 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-27 10:44:57,192 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-27 10:44:57,192 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-27 10:44:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:57,194 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-27 10:44:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-27 10:44:57,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:57,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:57,194 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-27 10:44:57,194 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-27 10:44:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:57,196 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-27 10:44:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-27 10:44:57,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:57,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:57,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:57,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:57,196 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-27 10:44:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-27 10:44:57,197 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2022-04-27 10:44:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:57,197 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-27 10:44:57,197 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-27 10:44:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-27 10:44:57,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:44:57,198 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:57,198 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-27 10:44:57,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 10:44:57,198 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-27 10:44:57,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash -448748011, now seen corresponding path program 1 times [2022-04-27 10:44:57,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:57,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678370485] [2022-04-27 10:44:57,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:57,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:57,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {3960#(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; {3951#true} is VALID [2022-04-27 10:44:57,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {3951#true} assume true; {3951#true} is VALID [2022-04-27 10:44:57,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3951#true} {3951#true} #149#return; {3951#true} is VALID [2022-04-27 10:44:57,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {3951#true} call ULTIMATE.init(); {3960#(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-27 10:44:57,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {3960#(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; {3951#true} is VALID [2022-04-27 10:44:57,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {3951#true} assume true; {3951#true} is VALID [2022-04-27 10:44:57,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3951#true} {3951#true} #149#return; {3951#true} is VALID [2022-04-27 10:44:57,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {3951#true} call #t~ret7 := main(); {3951#true} is VALID [2022-04-27 10:44:57,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {3951#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; {3951#true} is VALID [2022-04-27 10:44:57,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {3951#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; {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {3956#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {3957#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {3957#(<= (+ 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; {3957#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {3957#(<= (+ 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; {3957#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {3957#(<= (+ 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; {3957#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {3957#(<= (+ 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; {3957#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {3957#(<= (+ 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; {3957#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {3957#(<= (+ 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; {3957#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {3957#(<= (+ 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; {3957#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {3957#(<= (+ 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; {3958#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {3958#(<= (+ 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; {3958#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:57,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {3958#(<= (+ 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; {3959#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-27 10:44:57,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {3959#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {3952#false} is VALID [2022-04-27 10:44:57,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {3952#false} assume !false; {3952#false} is VALID [2022-04-27 10:44:57,300 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-27 10:44:57,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:57,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678370485] [2022-04-27 10:44:57,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678370485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:57,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:57,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:44:57,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383667566] [2022-04-27 10:44:57,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:57,301 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-27 10:44:57,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:57,302 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-27 10:44:57,317 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-27 10:44:57,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:44:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:57,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:44:57,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:44:57,318 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-27 10:44:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:57,647 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-27 10:44:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:44:57,648 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-27 10:44:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:57,648 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-27 10:44:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-27 10:44:57,649 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-27 10:44:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-27 10:44:57,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2022-04-27 10:44:57,717 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-27 10:44:57,718 INFO L225 Difference]: With dead ends: 62 [2022-04-27 10:44:57,718 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 10:44:57,719 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-27 10:44:57,719 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-27 10:44:57,720 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-27 10:44:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 10:44:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-04-27 10:44:57,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:57,734 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-27 10:44:57,734 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-27 10:44:57,735 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-27 10:44:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:57,736 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 10:44:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 10:44:57,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:57,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:57,736 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-27 10:44:57,736 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-27 10:44:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:57,737 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 10:44:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 10:44:57,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:57,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:57,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:57,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:57,738 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-27 10:44:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-27 10:44:57,739 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2022-04-27 10:44:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:57,739 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-27 10:44:57,739 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-27 10:44:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-27 10:44:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 10:44:57,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:57,740 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-27 10:44:57,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 10:44:57,740 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-27 10:44:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1026283297, now seen corresponding path program 1 times [2022-04-27 10:44:57,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:57,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384703712] [2022-04-27 10:44:57,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:57,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:57,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:57,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {4224#(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; {4216#true} is VALID [2022-04-27 10:44:57,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {4216#true} assume true; {4216#true} is VALID [2022-04-27 10:44:57,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4216#true} {4216#true} #149#return; {4216#true} is VALID [2022-04-27 10:44:57,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {4216#true} call ULTIMATE.init(); {4224#(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-27 10:44:57,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {4224#(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; {4216#true} is VALID [2022-04-27 10:44:57,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {4216#true} assume true; {4216#true} is VALID [2022-04-27 10:44:57,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4216#true} {4216#true} #149#return; {4216#true} is VALID [2022-04-27 10:44:57,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {4216#true} call #t~ret7 := main(); {4216#true} is VALID [2022-04-27 10:44:57,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {4216#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; {4216#true} is VALID [2022-04-27 10:44:57,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {4216#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; {4216#true} is VALID [2022-04-27 10:44:57,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {4216#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4221#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:57,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {4221#(= main_~main__j~0 0)} assume ~main__i~0 < ~main__len~0; {4221#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:57,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {4221#(= main_~main__j~0 0)} assume ~main__j~0 < ~main__limit~0; {4221#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:57,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {4221#(= 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; {4221#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:57,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {4221#(= 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; {4221#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:57,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {4221#(= 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; {4221#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:57,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {4221#(= 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; {4221#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:57,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {4221#(= 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; {4221#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:57,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {4221#(= 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; {4221#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:57,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {4221#(= 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; {4221#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:57,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {4221#(= 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; {4222#(<= 1 main_~main__j~0)} is VALID [2022-04-27 10:44:57,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {4222#(<= 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; {4222#(<= 1 main_~main__j~0)} is VALID [2022-04-27 10:44:57,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {4222#(<= 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; {4222#(<= 1 main_~main__j~0)} is VALID [2022-04-27 10:44:57,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {4222#(<= 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; {4223#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 10:44:57,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {4223#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {4217#false} is VALID [2022-04-27 10:44:57,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {4217#false} assume !false; {4217#false} is VALID [2022-04-27 10:44:57,814 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-27 10:44:57,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:57,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384703712] [2022-04-27 10:44:57,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384703712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:57,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:57,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:44:57,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446834387] [2022-04-27 10:44:57,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:57,815 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-27 10:44:57,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:57,815 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-27 10:44:57,830 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-27 10:44:57,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:44:57,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:57,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:44:57,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:44:57,830 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-27 10:44:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:58,197 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-27 10:44:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:44:58,197 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-27 10:44:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:58,198 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-27 10:44:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-27 10:44:58,199 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-27 10:44:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-27 10:44:58,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-27 10:44:58,283 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-27 10:44:58,284 INFO L225 Difference]: With dead ends: 87 [2022-04-27 10:44:58,284 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 10:44:58,285 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-27 10:44:58,285 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-27 10:44:58,286 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-27 10:44:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 10:44:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2022-04-27 10:44:58,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:58,302 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-27 10:44:58,302 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-27 10:44:58,302 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-27 10:44:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:58,303 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-27 10:44:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-27 10:44:58,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:58,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:58,304 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-27 10:44:58,304 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-27 10:44:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:58,305 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-27 10:44:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-27 10:44:58,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:58,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:58,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:58,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:58,306 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-27 10:44:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 10:44:58,307 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2022-04-27 10:44:58,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:58,307 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 10:44:58,307 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-27 10:44:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 10:44:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 10:44:58,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:58,307 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-27 10:44:58,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 10:44:58,308 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-27 10:44:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1750007973, now seen corresponding path program 1 times [2022-04-27 10:44:58,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:58,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189751257] [2022-04-27 10:44:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:58,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:58,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:58,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {4560#(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; {4551#true} is VALID [2022-04-27 10:44:58,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {4551#true} assume true; {4551#true} is VALID [2022-04-27 10:44:58,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4551#true} {4551#true} #149#return; {4551#true} is VALID [2022-04-27 10:44:58,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {4551#true} call ULTIMATE.init(); {4560#(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-27 10:44:58,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {4560#(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; {4551#true} is VALID [2022-04-27 10:44:58,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {4551#true} assume true; {4551#true} is VALID [2022-04-27 10:44:58,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4551#true} {4551#true} #149#return; {4551#true} is VALID [2022-04-27 10:44:58,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {4551#true} call #t~ret7 := main(); {4551#true} is VALID [2022-04-27 10:44:58,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {4551#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; {4551#true} is VALID [2022-04-27 10:44:58,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {4551#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; {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__i~0 < ~main__len~0; {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {4556#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} assume ~main__j~0 < ~main__limit~0; {4557#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {4557#(<= (+ 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; {4557#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {4557#(<= (+ 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; {4557#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {4557#(<= (+ 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; {4557#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {4557#(<= (+ 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; {4557#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {4557#(<= (+ 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; {4557#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {4557#(<= (+ 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; {4557#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {4557#(<= (+ 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; {4557#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {4557#(<= (+ 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; {4558#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {4558#(<= (+ 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; {4558#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {4558#(<= (+ 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; {4558#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {4558#(<= (+ 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; {4558#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 10:44:58,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {4558#(<= (+ 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; {4559#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-27 10:44:58,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {4559#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {4552#false} is VALID [2022-04-27 10:44:58,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {4552#false} assume !false; {4552#false} is VALID [2022-04-27 10:44:58,395 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-27 10:44:58,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:58,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189751257] [2022-04-27 10:44:58,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189751257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:58,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:58,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:44:58,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761657310] [2022-04-27 10:44:58,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:58,397 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-27 10:44:58,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:58,397 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-27 10:44:58,412 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-27 10:44:58,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:44:58,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:58,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:44:58,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:44:58,413 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-27 10:44:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:58,725 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 10:44:58,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:44:58,726 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-27 10:44:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:58,726 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-27 10:44:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-27 10:44:58,727 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-27 10:44:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-27 10:44:58,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2022-04-27 10:44:58,804 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-27 10:44:58,805 INFO L225 Difference]: With dead ends: 60 [2022-04-27 10:44:58,805 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 10:44:58,806 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-27 10:44:58,806 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-27 10:44:58,806 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-27 10:44:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 10:44:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2022-04-27 10:44:58,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:58,825 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-27 10:44:58,827 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-27 10:44:58,827 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-27 10:44:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:58,830 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-27 10:44:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-27 10:44:58,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:58,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:58,831 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-27 10:44:58,831 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-27 10:44:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:58,832 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-27 10:44:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-27 10:44:58,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:58,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:58,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:58,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:58,834 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-27 10:44:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 10:44:58,835 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2022-04-27 10:44:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:58,835 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 10:44:58,835 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-27 10:44:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 10:44:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:44:58,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:44:58,836 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-27 10:44:58,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 10:44:58,836 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-27 10:44:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:44:58,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1584330853, now seen corresponding path program 1 times [2022-04-27 10:44:58,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:44:58,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081655419] [2022-04-27 10:44:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:44:58,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:44:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:58,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:44:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:44:58,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {4815#(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; {4806#true} is VALID [2022-04-27 10:44:58,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {4806#true} assume true; {4806#true} is VALID [2022-04-27 10:44:58,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4806#true} {4806#true} #149#return; {4806#true} is VALID [2022-04-27 10:44:58,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {4806#true} call ULTIMATE.init(); {4815#(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-27 10:44:58,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {4815#(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; {4806#true} is VALID [2022-04-27 10:44:58,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {4806#true} assume true; {4806#true} is VALID [2022-04-27 10:44:58,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4806#true} {4806#true} #149#return; {4806#true} is VALID [2022-04-27 10:44:58,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {4806#true} call #t~ret7 := main(); {4806#true} is VALID [2022-04-27 10:44:58,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {4806#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; {4806#true} is VALID [2022-04-27 10:44:58,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {4806#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; {4806#true} is VALID [2022-04-27 10:44:58,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {4806#true} assume ~main__i~0 < ~main__len~0;~main__j~0 := 0; {4811#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:58,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {4811#(= main_~main__j~0 0)} assume ~main__i~0 < ~main__len~0; {4811#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:58,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {4811#(= main_~main__j~0 0)} assume ~main__j~0 < ~main__limit~0; {4811#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:58,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {4811#(= 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; {4811#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:58,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {4811#(= 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; {4811#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:58,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {4811#(= 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; {4811#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:58,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {4811#(= 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; {4811#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:58,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {4811#(= 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; {4811#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:58,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {4811#(= 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; {4811#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:58,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {4811#(= 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; {4811#(= main_~main__j~0 0)} is VALID [2022-04-27 10:44:58,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {4811#(= 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; {4812#(<= 1 main_~main__j~0)} is VALID [2022-04-27 10:44:58,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {4812#(<= 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; {4812#(<= 1 main_~main__j~0)} is VALID [2022-04-27 10:44:58,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {4812#(<= 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; {4812#(<= 1 main_~main__j~0)} is VALID [2022-04-27 10:44:58,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {4812#(<= 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; {4812#(<= 1 main_~main__j~0)} is VALID [2022-04-27 10:44:58,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {4812#(<= 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; {4813#(<= 2 main_~main__j~0)} is VALID [2022-04-27 10:44:58,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {4813#(<= 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; {4814#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-27 10:44:58,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {4814#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {4807#false} is VALID [2022-04-27 10:44:58,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {4807#false} assume !false; {4807#false} is VALID [2022-04-27 10:44:58,926 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-27 10:44:58,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:44:58,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081655419] [2022-04-27 10:44:58,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081655419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:44:58,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:44:58,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:44:58,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829513440] [2022-04-27 10:44:58,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:44:58,929 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-27 10:44:58,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:44:58,929 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-27 10:44:58,946 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-27 10:44:58,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:44:58,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:44:58,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:44:58,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:44:58,947 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-27 10:44:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:59,552 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2022-04-27 10:44:59,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:44:59,553 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-27 10:44:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:44:59,553 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-27 10:44:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-27 10:44:59,554 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-27 10:44:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-27 10:44:59,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-04-27 10:44:59,679 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-27 10:44:59,679 INFO L225 Difference]: With dead ends: 125 [2022-04-27 10:44:59,679 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:44:59,680 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-27 10:44:59,680 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-27 10:44:59,680 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-27 10:44:59,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:44:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:44:59,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:44:59,681 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-27 10:44:59,681 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-27 10:44:59,681 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-27 10:44:59,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:59,681 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:44:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:44:59,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:59,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:59,682 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-27 10:44:59,682 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-27 10:44:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:44:59,682 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:44:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:44:59,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:59,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:44:59,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:44:59,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:44:59,682 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-27 10:44:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:44:59,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-04-27 10:44:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:44:59,683 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:44:59,683 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-27 10:44:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:44:59,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:44:59,685 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-27 10:44:59,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-27 10:44:59,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-27 10:44:59,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-27 10:44:59,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-27 10:44:59,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-27 10:44:59,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-27 10:44:59,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-27 10:44:59,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-27 10:44:59,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-27 10:44:59,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-27 10:44:59,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-27 10:44:59,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-27 10:44:59,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-27 10:44:59,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-27 10:44:59,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-27 10:44:59,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 10:44:59,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:45:55,607 WARN L232 SmtUtils]: Spent 55.92s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 10:48:56,039 WARN L232 SmtUtils]: Spent 3.01m on a formula simplification that was a NOOP. DAG size: 144 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)