/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.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 21:34:06,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:34:06,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:34:06,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:34:06,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:34:06,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:34:06,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:34:06,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:34:06,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:34:06,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:34:06,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:34:06,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:34:06,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:34:06,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:34:06,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:34:06,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:34:06,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:34:06,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:34:06,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:34:06,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:34:06,173 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:34:06,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:34:06,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:34:06,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:34:06,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:34:06,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:34:06,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:34:06,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:34:06,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:34:06,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:34:06,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:34:06,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:34:06,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:34:06,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:34:06,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:34:06,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:34:06,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:34:06,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:34:06,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:34:06,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:34:06,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:34:06,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:34:06,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:34:06,213 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:34:06,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:34:06,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:34:06,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:34:06,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:34:06,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:34:06,215 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:34:06,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:34:06,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:34:06,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:34:06,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:34:06,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:34:06,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:34:06,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:34:06,217 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:34:06,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:34:06,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:34:06,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:34:06,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:34:06,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:34:06,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:34:06,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:34:06,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:34:06,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:34:06,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:34:06,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:34:06,218 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:34:06,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:34:06,219 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:34:06,219 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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 21:34:06,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:34:06,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:34:06,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:34:06,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:34:06,427 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:34:06,427 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 21:34:06,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd783f1a5/fa7d580ecf9e4df48934df60a681a690/FLAG0b8f0110d [2022-04-27 21:34:06,837 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:34:06,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2022-04-27 21:34:06,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd783f1a5/fa7d580ecf9e4df48934df60a681a690/FLAG0b8f0110d [2022-04-27 21:34:06,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd783f1a5/fa7d580ecf9e4df48934df60a681a690 [2022-04-27 21:34:06,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:34:06,861 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:34:06,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:34:06,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:34:06,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:34:06,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:34:06" (1/1) ... [2022-04-27 21:34:06,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7513e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:06, skipping insertion in model container [2022-04-27 21:34:06,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:34:06" (1/1) ... [2022-04-27 21:34:06,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:34:06,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:34:07,072 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 21:34:07,074 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 21:34:07,076 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 21:34:07,077 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 21:34:07,077 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 21:34:07,078 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 21:34:07,080 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 21:34:07,081 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 21:34:07,082 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 21:34:07,083 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 21:34:07,100 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 21:34:07,103 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 21:34:07,104 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 21:34:07,105 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 21:34:07,106 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 21:34:07,107 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 21:34:07,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:34:07,114 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:34:07,122 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 21:34:07,123 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 21:34:07,124 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 21:34:07,125 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 21:34:07,125 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 21:34:07,126 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 21:34:07,127 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 21:34:07,128 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 21:34:07,129 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 21:34:07,129 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 21:34:07,131 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 21:34:07,131 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 21:34:07,132 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 21:34:07,133 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 21:34:07,134 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 21:34:07,135 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 21:34:07,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:34:07,147 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:34:07,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:07 WrapperNode [2022-04-27 21:34:07,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:34:07,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:34:07,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:34:07,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:34:07,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:07" (1/1) ... [2022-04-27 21:34:07,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:07" (1/1) ... [2022-04-27 21:34:07,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:07" (1/1) ... [2022-04-27 21:34:07,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:07" (1/1) ... [2022-04-27 21:34:07,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:07" (1/1) ... [2022-04-27 21:34:07,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:07" (1/1) ... [2022-04-27 21:34:07,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:07" (1/1) ... [2022-04-27 21:34:07,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:34:07,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:34:07,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:34:07,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:34:07,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:07" (1/1) ... [2022-04-27 21:34:07,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:34:07,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:34:07,213 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 21:34:07,224 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 21:34:07,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:34:07,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:34:07,246 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:34:07,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:34:07,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:34:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:34:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:34:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:34:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:34:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:34:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:34:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:34:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:34:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:34:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:34:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:34:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:34:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:34:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:34:07,302 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:34:07,304 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:34:07,508 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:34:07,512 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:34:07,512 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 21:34:07,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:34:07 BoogieIcfgContainer [2022-04-27 21:34:07,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:34:07,514 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:34:07,514 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:34:07,515 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:34:07,521 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:34:07" (1/1) ... [2022-04-27 21:34:07,522 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:34:07,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:34:07 BasicIcfg [2022-04-27 21:34:07,567 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:34:07,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:34:07,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:34:07,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:34:07,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:34:06" (1/4) ... [2022-04-27 21:34:07,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2562d82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:34:07, skipping insertion in model container [2022-04-27 21:34:07,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:34:07" (2/4) ... [2022-04-27 21:34:07,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2562d82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:34:07, skipping insertion in model container [2022-04-27 21:34:07,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:34:07" (3/4) ... [2022-04-27 21:34:07,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2562d82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:34:07, skipping insertion in model container [2022-04-27 21:34:07,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:34:07" (4/4) ... [2022-04-27 21:34:07,572 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.cqvasr [2022-04-27 21:34:07,580 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:34:07,581 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-27 21:34:07,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:34:07,629 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=FINITE_AUTOMATA, 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@7748d5f0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5339ba00 [2022-04-27 21:34:07,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-27 21:34:07,635 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 21:34:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:34:07,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:07,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:07,641 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 21:34:07,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:07,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2053356655, now seen corresponding path program 1 times [2022-04-27 21:34:07,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:07,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882709293] [2022-04-27 21:34:07,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:07,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:07,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:07,874 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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {68#true} is VALID [2022-04-27 21:34:07,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {68#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-27 21:34:07,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68#true} {68#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-27 21:34:07,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {68#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {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 21:34:07,877 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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {68#true} is VALID [2022-04-27 21:34:07,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-27 21:34:07,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-27 21:34:07,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {68#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-27 21:34:07,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {68#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {68#true} is VALID [2022-04-27 21:34:07,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {68#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {68#true} is VALID [2022-04-27 21:34:07,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {68#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {68#true} is VALID [2022-04-27 21:34:07,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {68#true} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-27 21:34:07,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#true} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {68#true} is VALID [2022-04-27 21:34:07,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#true} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {73#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 21:34:07,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {73#(not (= main_~__VERIFIER_assert__cond~0 0))} [169] L45-->L47: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {69#false} is VALID [2022-04-27 21:34:07,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {69#false} [172] L47-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69#false} is VALID [2022-04-27 21:34:07,884 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 21:34:07,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:07,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882709293] [2022-04-27 21:34:07,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882709293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:07,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:07,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:34:07,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111508875] [2022-04-27 21:34:07,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:07,891 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 21:34:07,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:07,895 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 21:34:07,915 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 21:34:07,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:34:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:07,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:34:07,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:34:07,932 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 21:34:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:08,148 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2022-04-27 21:34:08,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:34:08,149 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 21:34:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:08,150 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 21:34:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-04-27 21:34:08,161 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 21:34:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-04-27 21:34:08,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 118 transitions. [2022-04-27 21:34:08,255 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 21:34:08,264 INFO L225 Difference]: With dead ends: 90 [2022-04-27 21:34:08,264 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 21:34:08,266 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 21:34:08,268 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 21:34:08,269 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 21:34:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 21:34:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2022-04-27 21:34:08,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:08,289 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 21:34:08,289 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 21:34:08,290 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 21:34:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:08,293 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-27 21:34:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-27 21:34:08,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:08,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:08,294 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 21:34:08,294 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 21:34:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:08,298 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-27 21:34:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-27 21:34:08,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:08,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:08,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:08,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:08,299 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 21:34:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-27 21:34:08,301 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2022-04-27 21:34:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:08,302 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-27 21:34:08,302 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 21:34:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-27 21:34:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:34:08,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:08,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:08,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:34:08,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:08,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash 770454336, now seen corresponding path program 1 times [2022-04-27 21:34:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:08,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105997691] [2022-04-27 21:34:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:08,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:08,376 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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {398#true} is VALID [2022-04-27 21:34:08,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 21:34:08,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {398#true} {398#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 21:34:08,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {398#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {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 21:34:08,379 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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {398#true} is VALID [2022-04-27 21:34:08,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 21:34:08,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 21:34:08,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-27 21:34:08,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {398#true} is VALID [2022-04-27 21:34:08,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {403#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:08,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {403#(<= 0 main_~main__i~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {403#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:08,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {403#(<= 0 main_~main__i~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {403#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:08,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {403#(<= 0 main_~main__i~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {403#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:08,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {403#(<= 0 main_~main__i~0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {403#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:08,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {403#(<= 0 main_~main__i~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {404#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 21:34:08,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {404#(not (= main_~__VERIFIER_assert__cond~1 0))} [174] L57-->L59: Formula: (= v_main_~__VERIFIER_assert__cond~1_3 0) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} AuxVars[] AssignedVars[] {399#false} is VALID [2022-04-27 21:34:08,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {399#false} [178] L59-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {399#false} is VALID [2022-04-27 21:34:08,384 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 21:34:08,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:08,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105997691] [2022-04-27 21:34:08,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105997691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:08,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:08,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:34:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437303571] [2022-04-27 21:34:08,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:08,386 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 21:34:08,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:08,386 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 21:34:08,402 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 21:34:08,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:34:08,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:08,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:34:08,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:08,404 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 21:34:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:08,587 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-04-27 21:34:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:34:08,587 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 21:34:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:08,587 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 21:34:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-04-27 21:34:08,589 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 21:34:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-04-27 21:34:08,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 84 transitions. [2022-04-27 21:34:08,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:08,666 INFO L225 Difference]: With dead ends: 77 [2022-04-27 21:34:08,666 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 21:34:08,666 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 21:34:08,669 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 150 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:08,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 70 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:34:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 21:34:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2022-04-27 21:34:08,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:08,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 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 21:34:08,686 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 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 21:34:08,687 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 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 21:34:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:08,694 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-27 21:34:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-27 21:34:08,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:08,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:08,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 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 75 states. [2022-04-27 21:34:08,696 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 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 75 states. [2022-04-27 21:34:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:08,699 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-27 21:34:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-27 21:34:08,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:08,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:08,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:08,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 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 21:34:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-04-27 21:34:08,701 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 14 [2022-04-27 21:34:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:08,701 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-04-27 21:34:08,701 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 21:34:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-27 21:34:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:34:08,702 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:08,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:08,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:34:08,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:08,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:08,703 INFO L85 PathProgramCache]: Analyzing trace with hash 770485154, now seen corresponding path program 1 times [2022-04-27 21:34:08,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:08,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965623799] [2022-04-27 21:34:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:08,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:08,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:08,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {720#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {713#true} is VALID [2022-04-27 21:34:08,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:34:08,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {713#true} {713#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:34:08,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {713#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {720#(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 21:34:08,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {720#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {713#true} is VALID [2022-04-27 21:34:08,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {713#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:34:08,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {713#true} {713#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:34:08,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {713#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-27 21:34:08,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {713#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {713#true} is VALID [2022-04-27 21:34:08,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {713#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {713#true} is VALID [2022-04-27 21:34:08,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {713#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {718#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 21:34:08,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {718#(not (<= main_~main__len~0 main_~main__i~0))} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {718#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 21:34:08,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {718#(not (<= main_~main__len~0 main_~main__i~0))} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {718#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 21:34:08,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {718#(not (<= main_~main__len~0 main_~main__i~0))} [168] L38-->L293: Formula: (not (< (+ v_main_~main__i~0_1 1) v_main_~main__len~0_1)) InVars {main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} OutVars{main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[] {718#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 21:34:08,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {718#(not (<= main_~main__len~0 main_~main__i~0))} [171] L293-->L74: Formula: (and (= v_main_~__tmp_3~0_1 (ite (< v_main_~main__i~0_10 v_main_~main__len~0_9) 1 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__len~0=v_main_~main__len~0_9, main_~main__i~0=v_main_~main__i~0_10} OutVars{main_~main__len~0=v_main_~main__len~0_9, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__i~0=v_main_~main__i~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {719#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-27 21:34:08,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {719#(not (= main_~__VERIFIER_assert__cond~2 0))} [176] L74-->L76: Formula: (= v_main_~__VERIFIER_assert__cond~2_3 0) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} OutVars{main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-27 21:34:08,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {714#false} [182] L76-->mainErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-27 21:34:08,770 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 21:34:08,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:08,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965623799] [2022-04-27 21:34:08,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965623799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:08,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:08,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:34:08,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759180414] [2022-04-27 21:34:08,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:08,771 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 21:34:08,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:08,771 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 21:34:08,779 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 21:34:08,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:34:08,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:08,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:34:08,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:08,780 INFO L87 Difference]: Start difference. First operand 57 states and 61 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 21:34:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:09,023 INFO L93 Difference]: Finished difference Result 147 states and 162 transitions. [2022-04-27 21:34:09,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:34:09,023 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 21:34:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:09,023 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 21:34:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2022-04-27 21:34:09,027 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 21:34:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2022-04-27 21:34:09,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 162 transitions. [2022-04-27 21:34:09,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:09,131 INFO L225 Difference]: With dead ends: 147 [2022-04-27 21:34:09,131 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 21:34:09,131 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 21:34:09,132 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 131 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:09,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 95 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:34:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 21:34:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2022-04-27 21:34:09,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:09,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 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 21:34:09,139 INFO L74 IsIncluded]: Start isIncluded. First operand 97 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 21:34:09,139 INFO L87 Difference]: Start difference. First operand 97 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 21:34:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:09,142 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-04-27 21:34:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-04-27 21:34:09,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:09,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:09,142 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 97 states. [2022-04-27 21:34:09,143 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 97 states. [2022-04-27 21:34:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:09,145 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-04-27 21:34:09,145 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-04-27 21:34:09,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:09,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:09,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:09,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:09,146 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 21:34:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-27 21:34:09,147 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2022-04-27 21:34:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:09,147 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-27 21:34:09,147 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 21:34:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-27 21:34:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:34:09,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:09,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:09,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:34:09,148 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 21:34:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1884762791, now seen corresponding path program 1 times [2022-04-27 21:34:09,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:09,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525823602] [2022-04-27 21:34:09,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:09,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:09,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:09,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {1158#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1151#true} is VALID [2022-04-27 21:34:09,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {1151#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1151#true} is VALID [2022-04-27 21:34:09,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1151#true} {1151#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1151#true} is VALID [2022-04-27 21:34:09,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {1151#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1158#(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 21:34:09,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1151#true} is VALID [2022-04-27 21:34:09,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {1151#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1151#true} is VALID [2022-04-27 21:34:09,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1151#true} {1151#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1151#true} is VALID [2022-04-27 21:34:09,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {1151#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1151#true} is VALID [2022-04-27 21:34:09,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {1151#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {1151#true} is VALID [2022-04-27 21:34:09,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {1151#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {1156#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:09,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {1156#(<= 0 main_~main__i~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {1156#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:09,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {1156#(<= 0 main_~main__i~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {1156#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:09,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {1156#(<= 0 main_~main__i~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {1156#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:09,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {1156#(<= 0 main_~main__i~0)} [168] L38-->L293: Formula: (not (< (+ v_main_~main__i~0_1 1) v_main_~main__len~0_1)) InVars {main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} OutVars{main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[] {1156#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:09,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {1156#(<= 0 main_~main__i~0)} [171] L293-->L74: Formula: (and (= v_main_~__tmp_3~0_1 (ite (< v_main_~main__i~0_10 v_main_~main__len~0_9) 1 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__len~0=v_main_~main__len~0_9, main_~main__i~0=v_main_~main__i~0_10} OutVars{main_~main__len~0=v_main_~main__len~0_9, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__i~0=v_main_~main__i~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1156#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:09,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {1156#(<= 0 main_~main__i~0)} [177] L74-->L86: Formula: (and (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__i~0_11) 1 0)) (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__i~0=v_main_~main__i~0_11} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1157#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-27 21:34:09,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {1157#(not (= main_~__VERIFIER_assert__cond~3 0))} [184] L86-->L88: Formula: (= v_main_~__VERIFIER_assert__cond~3_3 0) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_3} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_3} AuxVars[] AssignedVars[] {1152#false} is VALID [2022-04-27 21:34:09,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {1152#false} [188] L88-->mainErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1152#false} is VALID [2022-04-27 21:34:09,193 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 21:34:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:09,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525823602] [2022-04-27 21:34:09,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525823602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:09,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:09,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:34:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853701598] [2022-04-27 21:34:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:09,194 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 21:34:09,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:09,194 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 21:34:09,202 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 21:34:09,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:34:09,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:09,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:34:09,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:09,203 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 21:34:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:09,387 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-27 21:34:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:34:09,387 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 21:34:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:09,387 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 21:34:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-04-27 21:34:09,389 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 21:34:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-04-27 21:34:09,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2022-04-27 21:34:09,464 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 21:34:09,466 INFO L225 Difference]: With dead ends: 96 [2022-04-27 21:34:09,466 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 21:34:09,466 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 21:34:09,467 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 21:34:09,467 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 21:34:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 21:34:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2022-04-27 21:34:09,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:09,474 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 21:34:09,475 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 21:34:09,475 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 21:34:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:09,477 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-27 21:34:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-27 21:34:09,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:09,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:09,477 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 21:34:09,477 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 21:34:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:09,479 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-27 21:34:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-27 21:34:09,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:09,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:09,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:09,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:09,480 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 21:34:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-27 21:34:09,481 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2022-04-27 21:34:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:09,481 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-27 21:34:09,481 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 21:34:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 21:34:09,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:34:09,482 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:09,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:09,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 21:34:09,482 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:09,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1672280616, now seen corresponding path program 1 times [2022-04-27 21:34:09,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:09,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284591739] [2022-04-27 21:34:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:09,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:09,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:09,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {1530#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1523#true} is VALID [2022-04-27 21:34:09,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1523#true} is VALID [2022-04-27 21:34:09,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1523#true} {1523#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1523#true} is VALID [2022-04-27 21:34:09,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {1523#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#(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 21:34:09,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1523#true} is VALID [2022-04-27 21:34:09,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {1523#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1523#true} is VALID [2022-04-27 21:34:09,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1523#true} {1523#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1523#true} is VALID [2022-04-27 21:34:09,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {1523#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1523#true} is VALID [2022-04-27 21:34:09,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {1523#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {1523#true} is VALID [2022-04-27 21:34:09,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {1523#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {1523#true} is VALID [2022-04-27 21:34:09,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {1523#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {1528#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 21:34:09,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {1528#(not (<= main_~main__len~0 main_~main__i~0))} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {1528#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 21:34:09,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {1528#(not (<= main_~main__len~0 main_~main__i~0))} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {1528#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 21:34:09,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {1528#(not (<= main_~main__len~0 main_~main__i~0))} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {1528#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 21:34:09,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#(not (<= main_~main__len~0 main_~main__i~0))} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {1528#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 21:34:09,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#(not (<= main_~main__len~0 main_~main__i~0))} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {1528#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 21:34:09,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#(not (<= main_~main__len~0 main_~main__i~0))} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {1529#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-27 21:34:09,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(not (= main_~__VERIFIER_assert__cond~6 0))} [186] L139-->L141: Formula: (= v_main_~__VERIFIER_assert__cond~6_3 0) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} OutVars{main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} AuxVars[] AssignedVars[] {1524#false} is VALID [2022-04-27 21:34:09,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {1524#false} [192] L141-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1524#false} is VALID [2022-04-27 21:34:09,530 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 21:34:09,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:09,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284591739] [2022-04-27 21:34:09,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284591739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:09,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:09,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:34:09,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690467634] [2022-04-27 21:34:09,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:09,531 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 21:34:09,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:09,531 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 21:34:09,539 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 21:34:09,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:34:09,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:09,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:34:09,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:09,540 INFO L87 Difference]: Start difference. First operand 54 states and 58 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 21:34:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:09,714 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-04-27 21:34:09,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:34:09,714 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 21:34:09,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:09,715 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 21:34:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-04-27 21:34:09,716 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 21:34:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-04-27 21:34:09,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2022-04-27 21:34:09,777 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 21:34:09,778 INFO L225 Difference]: With dead ends: 73 [2022-04-27 21:34:09,778 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 21:34:09,778 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 21:34:09,779 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 115 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:09,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 70 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:34:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 21:34:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2022-04-27 21:34:09,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:09,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 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 21:34:09,788 INFO L74 IsIncluded]: Start isIncluded. First operand 71 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 21:34:09,789 INFO L87 Difference]: Start difference. First operand 71 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 21:34:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:09,790 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-04-27 21:34:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-04-27 21:34:09,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:09,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:09,791 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 71 states. [2022-04-27 21:34:09,791 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 71 states. [2022-04-27 21:34:09,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:09,792 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-04-27 21:34:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-04-27 21:34:09,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:09,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:09,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:09,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:09,793 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 21:34:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-27 21:34:09,794 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2022-04-27 21:34:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:09,794 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-27 21:34:09,794 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 21:34:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-27 21:34:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:34:09,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:09,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:34:09,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 21:34:09,794 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:09,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1701896842, now seen corresponding path program 1 times [2022-04-27 21:34:09,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:09,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639018512] [2022-04-27 21:34:09,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:09,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:09,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:09,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {1836#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1828#true} is VALID [2022-04-27 21:34:09,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1828#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1828#true} is VALID [2022-04-27 21:34:09,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1828#true} {1828#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1828#true} is VALID [2022-04-27 21:34:09,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {1828#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1836#(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 21:34:09,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {1828#true} is VALID [2022-04-27 21:34:09,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {1828#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1828#true} is VALID [2022-04-27 21:34:09,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1828#true} {1828#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1828#true} is VALID [2022-04-27 21:34:09,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {1828#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1828#true} is VALID [2022-04-27 21:34:09,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {1828#true} is VALID [2022-04-27 21:34:09,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {1828#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {1833#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:09,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {1833#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {1833#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:09,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {1833#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {1833#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:09,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {1833#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {1834#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:09,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {1834#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [168] L38-->L293: Formula: (not (< (+ v_main_~main__i~0_1 1) v_main_~main__len~0_1)) InVars {main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} OutVars{main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[] {1834#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:09,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {1834#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [171] L293-->L74: Formula: (and (= v_main_~__tmp_3~0_1 (ite (< v_main_~main__i~0_10 v_main_~main__len~0_9) 1 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__len~0=v_main_~main__len~0_9, main_~main__i~0=v_main_~main__i~0_10} OutVars{main_~main__len~0=v_main_~main__len~0_9, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__i~0=v_main_~main__i~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1834#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:09,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {1834#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [177] L74-->L86: Formula: (and (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__i~0_11) 1 0)) (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__i~0=v_main_~main__i~0_11} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1834#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:09,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {1834#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [185] L86-->L98: Formula: (and (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1) (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__j~0_7 v_main_~main__bufsize~0_6) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_6, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main__j~0=v_main_~main__j~0_7} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_6, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__j~0=v_main_~main__j~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {1835#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 21:34:09,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {1835#(not (= main_~__VERIFIER_assert__cond~4 0))} [190] L98-->L100: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {1829#false} is VALID [2022-04-27 21:34:09,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {1829#false} [196] L100-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1829#false} is VALID [2022-04-27 21:34:09,878 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 21:34:09,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:09,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639018512] [2022-04-27 21:34:09,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639018512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:09,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:09,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:34:09,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468885351] [2022-04-27 21:34:09,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:09,880 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 21:34:09,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:09,880 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 21:34:09,888 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 21:34:09,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:34:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:09,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:34:09,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:34:09,889 INFO L87 Difference]: Start difference. First operand 52 states and 56 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 21:34:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:10,158 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-04-27 21:34:10,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:34:10,158 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 21:34:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:10,158 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 21:34:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-27 21:34:10,159 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 21:34:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-27 21:34:10,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2022-04-27 21:34:10,235 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 21:34:10,236 INFO L225 Difference]: With dead ends: 91 [2022-04-27 21:34:10,236 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 21:34:10,236 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 21:34:10,237 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 151 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:10,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 93 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:34:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 21:34:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2022-04-27 21:34:10,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:10,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 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 21:34:10,246 INFO L74 IsIncluded]: Start isIncluded. First operand 89 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 21:34:10,247 INFO L87 Difference]: Start difference. First operand 89 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 21:34:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:10,248 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-27 21:34:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-27 21:34:10,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:10,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:10,249 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 89 states. [2022-04-27 21:34:10,249 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 89 states. [2022-04-27 21:34:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:10,250 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-27 21:34:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-27 21:34:10,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:10,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:10,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:10,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:10,251 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 21:34:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-27 21:34:10,252 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2022-04-27 21:34:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:10,252 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-27 21:34:10,252 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 21:34:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-27 21:34:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:34:10,252 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:10,253 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 21:34:10,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 21:34:10,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash 301092767, now seen corresponding path program 1 times [2022-04-27 21:34:10,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:10,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626854441] [2022-04-27 21:34:10,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:10,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:10,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:10,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {2194#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2186#true} is VALID [2022-04-27 21:34:10,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {2186#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2186#true} is VALID [2022-04-27 21:34:10,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2186#true} {2186#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2186#true} is VALID [2022-04-27 21:34:10,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {2186#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2194#(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 21:34:10,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {2194#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2186#true} is VALID [2022-04-27 21:34:10,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {2186#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2186#true} is VALID [2022-04-27 21:34:10,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2186#true} {2186#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2186#true} is VALID [2022-04-27 21:34:10,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {2186#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2186#true} is VALID [2022-04-27 21:34:10,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {2186#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {2186#true} is VALID [2022-04-27 21:34:10,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {2186#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {2186#true} is VALID [2022-04-27 21:34:10,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {2186#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {2186#true} is VALID [2022-04-27 21:34:10,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {2186#true} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {2186#true} is VALID [2022-04-27 21:34:10,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {2186#true} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {2186#true} is VALID [2022-04-27 21:34:10,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {2186#true} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {2186#true} is VALID [2022-04-27 21:34:10,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {2186#true} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {2191#(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 21:34:10,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {2191#(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)))} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {2192#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:10,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {2192#(<= 0 main_~main__i~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {2192#(<= 0 main_~main__i~0)} is VALID [2022-04-27 21:34:10,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {2192#(<= 0 main_~main__i~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {2193#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 21:34:10,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {2193#(not (= main_~__VERIFIER_assert__cond~7 0))} [194] L151-->L153: Formula: (= v_main_~__VERIFIER_assert__cond~7_3 0) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} AuxVars[] AssignedVars[] {2187#false} is VALID [2022-04-27 21:34:10,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {2187#false} [200] L153-->mainErr7ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2187#false} is VALID [2022-04-27 21:34:10,326 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 21:34:10,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:10,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626854441] [2022-04-27 21:34:10,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626854441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:10,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:10,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:34:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484188363] [2022-04-27 21:34:10,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:10,327 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 21:34:10,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:10,327 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 21:34:10,335 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 21:34:10,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:34:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:34:10,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:34:10,336 INFO L87 Difference]: Start difference. First operand 50 states and 54 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 21:34:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:10,580 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-04-27 21:34:10,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:34:10,580 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 21:34:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:10,581 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 21:34:10,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 21:34:10,582 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 21:34:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 21:34:10,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-27 21:34:10,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:10,647 INFO L225 Difference]: With dead ends: 79 [2022-04-27 21:34:10,648 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 21:34:10,648 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 21:34:10,648 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 161 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:10,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 65 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:34:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 21:34:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2022-04-27 21:34:10,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:10,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 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 21:34:10,658 INFO L74 IsIncluded]: Start isIncluded. First operand 77 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 21:34:10,658 INFO L87 Difference]: Start difference. First operand 77 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 21:34:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:10,659 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-04-27 21:34:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-04-27 21:34:10,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:10,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:10,660 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 77 states. [2022-04-27 21:34:10,660 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 77 states. [2022-04-27 21:34:10,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:10,661 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-04-27 21:34:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-04-27 21:34:10,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:10,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:10,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:10,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:10,662 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 21:34:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-27 21:34:10,663 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2022-04-27 21:34:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:10,663 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-27 21:34:10,663 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 21:34:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-27 21:34:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:34:10,663 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:10,663 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 21:34:10,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 21:34:10,663 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 21:34:10,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1219195777, now seen corresponding path program 1 times [2022-04-27 21:34:10,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:10,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780817091] [2022-04-27 21:34:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:10,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:10,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:10,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {2518#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2511#true} is VALID [2022-04-27 21:34:10,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {2511#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2511#true} is VALID [2022-04-27 21:34:10,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2511#true} {2511#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2511#true} is VALID [2022-04-27 21:34:10,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {2511#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2518#(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 21:34:10,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {2518#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2511#true} is VALID [2022-04-27 21:34:10,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {2511#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2511#true} is VALID [2022-04-27 21:34:10,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2511#true} {2511#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2511#true} is VALID [2022-04-27 21:34:10,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {2511#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2511#true} is VALID [2022-04-27 21:34:10,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {2511#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {2511#true} is VALID [2022-04-27 21:34:10,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {2511#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {2511#true} is VALID [2022-04-27 21:34:10,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {2511#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {2516#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:10,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {2516#(<= 0 main_~main__j~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {2516#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:10,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {2516#(<= 0 main_~main__j~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {2516#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:10,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {2516#(<= 0 main_~main__j~0)} [168] L38-->L293: Formula: (not (< (+ v_main_~main__i~0_1 1) v_main_~main__len~0_1)) InVars {main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} OutVars{main_~main__len~0=v_main_~main__len~0_1, main_~main__i~0=v_main_~main__i~0_1} AuxVars[] AssignedVars[] {2516#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:10,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {2516#(<= 0 main_~main__j~0)} [171] L293-->L74: Formula: (and (= v_main_~__tmp_3~0_1 (ite (< v_main_~main__i~0_10 v_main_~main__len~0_9) 1 0)) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__len~0=v_main_~main__len~0_9, main_~main__i~0=v_main_~main__i~0_10} OutVars{main_~main__len~0=v_main_~main__len~0_9, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__i~0=v_main_~main__i~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {2516#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:10,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {2516#(<= 0 main_~main__j~0)} [177] L74-->L86: Formula: (and (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__i~0_11) 1 0)) (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__i~0=v_main_~main__i~0_11} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__i~0=v_main_~main__i~0_11} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {2516#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:10,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {2516#(<= 0 main_~main__j~0)} [185] L86-->L98: Formula: (and (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1) (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__j~0_7 v_main_~main__bufsize~0_6) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~3_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_6, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~main__j~0=v_main_~main__j~0_7} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_6, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__j~0=v_main_~main__j~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {2516#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:10,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {2516#(<= 0 main_~main__j~0)} [191] L98-->L110: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1) (= (ite (<= 0 v_main_~main__j~0_8) 1 0) v_main_~__tmp_6~0_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__j~0=v_main_~main__j~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__j~0=v_main_~main__j~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {2517#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 21:34:10,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {2517#(not (= main_~__VERIFIER_assert__cond~5 0))} [198] L110-->L112: Formula: (= v_main_~__VERIFIER_assert__cond~5_3 0) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} AuxVars[] AssignedVars[] {2512#false} is VALID [2022-04-27 21:34:10,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {2512#false} [204] L112-->mainErr5ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2512#false} is VALID [2022-04-27 21:34:10,705 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 21:34:10,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:10,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780817091] [2022-04-27 21:34:10,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780817091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:10,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:10,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:34:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569194638] [2022-04-27 21:34:10,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:10,706 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 21:34:10,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:10,706 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 21:34:10,715 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 21:34:10,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:34:10,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:10,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:34:10,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:10,716 INFO L87 Difference]: Start difference. First operand 48 states and 52 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 21:34:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:10,889 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-04-27 21:34:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:34:10,890 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 21:34:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:10,890 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 21:34:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-04-27 21:34:10,891 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 21:34:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-04-27 21:34:10,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 93 transitions. [2022-04-27 21:34:10,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:34:10,959 INFO L225 Difference]: With dead ends: 87 [2022-04-27 21:34:10,959 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 21:34:10,959 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 21:34:10,960 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 110 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:10,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 77 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:34:10,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 21:34:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2022-04-27 21:34:10,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:10,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 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 21:34:10,976 INFO L74 IsIncluded]: Start isIncluded. First operand 85 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 21:34:10,977 INFO L87 Difference]: Start difference. First operand 85 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 21:34:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:10,978 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-27 21:34:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-04-27 21:34:10,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:10,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:10,979 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 85 states. [2022-04-27 21:34:10,979 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 85 states. [2022-04-27 21:34:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:10,980 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-27 21:34:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-04-27 21:34:10,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:10,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:10,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:10,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:10,981 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 21:34:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-27 21:34:10,981 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2022-04-27 21:34:10,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:10,981 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-27 21:34:10,982 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 21:34:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-27 21:34:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:34:10,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:10,982 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 21:34:10,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 21:34:10,982 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 21:34:10,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:10,983 INFO L85 PathProgramCache]: Analyzing trace with hash 743942414, now seen corresponding path program 1 times [2022-04-27 21:34:10,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:10,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410636359] [2022-04-27 21:34:10,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:10,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:11,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:11,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {2857#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2849#true} is VALID [2022-04-27 21:34:11,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {2849#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-27 21:34:11,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2849#true} {2849#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-27 21:34:11,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {2849#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2857#(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 21:34:11,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {2857#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {2849#true} is VALID [2022-04-27 21:34:11,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {2849#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-27 21:34:11,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2849#true} {2849#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-27 21:34:11,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {2849#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-27 21:34:11,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {2849#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {2849#true} is VALID [2022-04-27 21:34:11,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {2849#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {2854#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:11,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {2854#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {2854#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:11,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {2854#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {2854#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:11,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {2854#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:11,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:11,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:11,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:11,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:11,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:11,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {2855#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {2856#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-27 21:34:11,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {2856#(not (= main_~__VERIFIER_assert__cond~8 0))} [202] L163-->L165: Formula: (= v_main_~__VERIFIER_assert__cond~8_3 0) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} OutVars{main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} AuxVars[] AssignedVars[] {2850#false} is VALID [2022-04-27 21:34:11,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {2850#false} [206] L165-->mainErr8ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2850#false} is VALID [2022-04-27 21:34:11,047 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 21:34:11,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:11,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410636359] [2022-04-27 21:34:11,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410636359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:11,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:11,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:34:11,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140897545] [2022-04-27 21:34:11,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:11,047 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 21:34:11,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:11,048 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 21:34:11,058 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 21:34:11,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:34:11,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:11,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:34:11,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:34:11,059 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 21:34:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:11,277 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-27 21:34:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:34:11,278 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 21:34:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:11,278 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 21:34:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 21:34:11,279 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 21:34:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 21:34:11,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-27 21:34:11,328 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 21:34:11,329 INFO L225 Difference]: With dead ends: 61 [2022-04-27 21:34:11,329 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 21:34:11,329 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 21:34:11,330 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:11,330 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.0s Time] [2022-04-27 21:34:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 21:34:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-04-27 21:34:11,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:11,340 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 21:34:11,340 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 21:34:11,340 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 21:34:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:11,342 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 21:34:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 21:34:11,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:11,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:11,342 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 21:34:11,342 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 21:34:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:11,343 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 21:34:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 21:34:11,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:11,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:11,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:11,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:11,343 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 21:34:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-27 21:34:11,344 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2022-04-27 21:34:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:11,344 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-27 21:34:11,344 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 21:34:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-27 21:34:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 21:34:11,345 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:11,345 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 21:34:11,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 21:34:11,345 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 21:34:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1587379587, now seen corresponding path program 1 times [2022-04-27 21:34:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:11,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912209945] [2022-04-27 21:34:11,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:11,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:11,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:11,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {3118#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3111#true} is VALID [2022-04-27 21:34:11,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {3111#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3111#true} is VALID [2022-04-27 21:34:11,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3111#true} {3111#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3111#true} is VALID [2022-04-27 21:34:11,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {3111#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3118#(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 21:34:11,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {3118#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3111#true} is VALID [2022-04-27 21:34:11,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {3111#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3111#true} is VALID [2022-04-27 21:34:11,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3111#true} is VALID [2022-04-27 21:34:11,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {3111#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3111#true} is VALID [2022-04-27 21:34:11,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {3111#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {3111#true} is VALID [2022-04-27 21:34:11,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {3111#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {3111#true} is VALID [2022-04-27 21:34:11,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {3111#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {3116#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:11,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {3116#(<= 0 main_~main__j~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {3116#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:11,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {3116#(<= 0 main_~main__j~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {3116#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:11,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {3116#(<= 0 main_~main__j~0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {3116#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:11,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {3116#(<= 0 main_~main__j~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3116#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:11,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {3116#(<= 0 main_~main__j~0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {3116#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:11,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {3116#(<= 0 main_~main__j~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3116#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:11,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {3116#(<= 0 main_~main__j~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {3116#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:11,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {3116#(<= 0 main_~main__j~0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {3116#(<= 0 main_~main__j~0)} is VALID [2022-04-27 21:34:11,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {3116#(<= 0 main_~main__j~0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {3117#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 21:34:11,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {3117#(not (= main_~__VERIFIER_assert__cond~9 0))} [208] L175-->L177: Formula: (= v_main_~__VERIFIER_assert__cond~9_3 0) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} AuxVars[] AssignedVars[] {3112#false} is VALID [2022-04-27 21:34:11,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {3112#false} [210] L177-->mainErr9ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3112#false} is VALID [2022-04-27 21:34:11,394 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 21:34:11,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:11,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912209945] [2022-04-27 21:34:11,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912209945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:11,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:11,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:34:11,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841692480] [2022-04-27 21:34:11,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:11,395 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 21:34:11,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:11,395 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 21:34:11,406 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 21:34:11,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:34:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:11,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:34:11,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:11,407 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 21:34:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:11,549 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-27 21:34:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:34:11,549 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 21:34:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:11,549 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 21:34:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 21:34:11,550 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 21:34:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 21:34:11,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 21:34:11,598 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 21:34:11,599 INFO L225 Difference]: With dead ends: 61 [2022-04-27 21:34:11,599 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 21:34:11,599 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 21:34:11,599 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 21:34:11,600 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 21:34:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 21:34:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2022-04-27 21:34:11,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:11,610 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 21:34:11,610 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 21:34:11,610 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 21:34:11,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:11,611 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 21:34:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 21:34:11,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:11,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:11,611 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 21:34:11,612 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 21:34:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:11,612 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 21:34:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 21:34:11,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:11,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:11,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:11,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:11,613 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 21:34:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-27 21:34:11,613 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2022-04-27 21:34:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:11,613 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-27 21:34:11,613 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 21:34:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 21:34:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 21:34:11,614 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:11,614 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 21:34:11,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 21:34:11,614 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 21:34:11,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1964128178, now seen corresponding path program 1 times [2022-04-27 21:34:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:11,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664723861] [2022-04-27 21:34:11,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:11,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:11,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:11,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {3374#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3367#true} is VALID [2022-04-27 21:34:11,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {3367#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3367#true} is VALID [2022-04-27 21:34:11,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3367#true} {3367#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3367#true} is VALID [2022-04-27 21:34:11,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {3367#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3374#(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 21:34:11,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {3374#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3367#true} is VALID [2022-04-27 21:34:11,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {3367#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3367#true} is VALID [2022-04-27 21:34:11,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3367#true} {3367#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3367#true} is VALID [2022-04-27 21:34:11,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {3367#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3367#true} is VALID [2022-04-27 21:34:11,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {3367#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {3367#true} is VALID [2022-04-27 21:34:11,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {3367#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {3367#true} is VALID [2022-04-27 21:34:11,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {3367#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {3367#true} is VALID [2022-04-27 21:34:11,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {3367#true} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {3367#true} is VALID [2022-04-27 21:34:11,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {3367#true} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {3367#true} is VALID [2022-04-27 21:34:11,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {3367#true} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 21:34:11,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 21:34:11,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 21:34:11,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 21:34:11,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 21:34:11,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 21:34:11,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 21:34:11,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {3372#(<= (+ 2 main_~main__i~0) main_~main__len~0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {3373#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 21:34:11,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {3373#(not (= main_~__VERIFIER_assert__cond~10 0))} [212] L191-->L193: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {3368#false} is VALID [2022-04-27 21:34:11,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {3368#false} [214] L193-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3368#false} is VALID [2022-04-27 21:34:11,667 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 21:34:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:11,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664723861] [2022-04-27 21:34:11,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664723861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:11,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:11,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:34:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410196559] [2022-04-27 21:34:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:11,668 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 21:34:11,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:11,668 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 21:34:11,679 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 21:34:11,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:34:11,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:11,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:34:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:34:11,679 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 21:34:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:11,873 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-04-27 21:34:11,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:34:11,873 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 21:34:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:11,874 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 21:34:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 21:34:11,874 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 21:34:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 21:34:11,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-27 21:34:11,925 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 21:34:11,926 INFO L225 Difference]: With dead ends: 69 [2022-04-27 21:34:11,926 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 21:34:11,926 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 21:34:11,927 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 21:34:11,927 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 21:34:11,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 21:34:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2022-04-27 21:34:11,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:11,944 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 21:34:11,944 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 21:34:11,944 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 21:34:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:11,945 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-27 21:34:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-27 21:34:11,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:11,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:11,946 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 21:34:11,946 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 21:34:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:11,947 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-27 21:34:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-27 21:34:11,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:11,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:11,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:11,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:11,947 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 21:34:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-27 21:34:11,947 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2022-04-27 21:34:11,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:11,948 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-27 21:34:11,948 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 21:34:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-27 21:34:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 21:34:11,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:11,948 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 21:34:11,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 21:34:11,948 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 21:34:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash 758432615, now seen corresponding path program 1 times [2022-04-27 21:34:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:11,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089551822] [2022-04-27 21:34:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:11,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:11,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {3657#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3649#true} is VALID [2022-04-27 21:34:11,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {3649#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3649#true} is VALID [2022-04-27 21:34:11,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3649#true} {3649#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3649#true} is VALID [2022-04-27 21:34:11,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {3649#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3657#(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 21:34:11,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {3657#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3649#true} is VALID [2022-04-27 21:34:11,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {3649#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3649#true} is VALID [2022-04-27 21:34:11,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3649#true} {3649#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3649#true} is VALID [2022-04-27 21:34:11,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {3649#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3649#true} is VALID [2022-04-27 21:34:11,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {3649#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {3649#true} is VALID [2022-04-27 21:34:11,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {3649#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {3654#(= main_~main__i~0 0)} is VALID [2022-04-27 21:34:11,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {3654#(= main_~main__i~0 0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {3654#(= main_~main__i~0 0)} is VALID [2022-04-27 21:34:11,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {3654#(= main_~main__i~0 0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {3654#(= main_~main__i~0 0)} is VALID [2022-04-27 21:34:11,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {3654#(= main_~main__i~0 0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {3654#(= main_~main__i~0 0)} is VALID [2022-04-27 21:34:11,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {3654#(= main_~main__i~0 0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {3654#(= main_~main__i~0 0)} is VALID [2022-04-27 21:34:11,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {3654#(= main_~main__i~0 0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3654#(= main_~main__i~0 0)} is VALID [2022-04-27 21:34:11,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {3654#(= main_~main__i~0 0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {3654#(= main_~main__i~0 0)} is VALID [2022-04-27 21:34:11,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {3654#(= main_~main__i~0 0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3654#(= main_~main__i~0 0)} is VALID [2022-04-27 21:34:11,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {3654#(= main_~main__i~0 0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {3654#(= main_~main__i~0 0)} is VALID [2022-04-27 21:34:11,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {3654#(= main_~main__i~0 0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {3654#(= main_~main__i~0 0)} is VALID [2022-04-27 21:34:11,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {3654#(= main_~main__i~0 0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {3654#(= main_~main__i~0 0)} is VALID [2022-04-27 21:34:11,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {3654#(= main_~main__i~0 0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {3655#(<= 1 main_~main__i~0)} is VALID [2022-04-27 21:34:11,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {3655#(<= 1 main_~main__i~0)} [213] L191-->L203: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__i~0_18) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {3656#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 21:34:11,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {3656#(not (= main_~__VERIFIER_assert__cond~11 0))} [216] L203-->L205: Formula: (= v_main_~__VERIFIER_assert__cond~11_3 0) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} AuxVars[] AssignedVars[] {3650#false} is VALID [2022-04-27 21:34:11,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {3650#false} [218] L205-->mainErr11ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3650#false} is VALID [2022-04-27 21:34:11,989 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 21:34:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:11,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089551822] [2022-04-27 21:34:11,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089551822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:11,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:11,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:34:11,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955340926] [2022-04-27 21:34:11,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:11,990 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 21:34:11,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:11,990 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 21:34:12,000 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 21:34:12,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:34:12,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:12,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:34:12,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:34:12,001 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 21:34:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:12,303 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-27 21:34:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:34:12,304 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 21:34:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:12,304 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 21:34:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 21:34:12,305 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 21:34:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 21:34:12,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2022-04-27 21:34:12,382 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 21:34:12,382 INFO L225 Difference]: With dead ends: 74 [2022-04-27 21:34:12,382 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 21:34:12,383 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 21:34:12,383 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 21:34:12,383 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 21:34:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 21:34:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2022-04-27 21:34:12,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:12,396 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 21:34:12,396 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 21:34:12,396 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 21:34:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:12,397 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-27 21:34:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-27 21:34:12,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:12,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:12,397 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 21:34:12,398 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 21:34:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:12,398 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-27 21:34:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-27 21:34:12,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:12,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:12,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:12,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:12,399 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 21:34:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-27 21:34:12,399 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2022-04-27 21:34:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:12,400 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-27 21:34:12,400 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 21:34:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-27 21:34:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:34:12,400 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:12,400 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 21:34:12,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 21:34:12,400 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 21:34:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2036575830, now seen corresponding path program 1 times [2022-04-27 21:34:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:12,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604264757] [2022-04-27 21:34:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:12,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {3954#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3945#true} is VALID [2022-04-27 21:34:12,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {3945#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3945#true} is VALID [2022-04-27 21:34:12,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3945#true} {3945#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3945#true} is VALID [2022-04-27 21:34:12,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {3945#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3954#(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 21:34:12,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {3954#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {3945#true} is VALID [2022-04-27 21:34:12,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {3945#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3945#true} is VALID [2022-04-27 21:34:12,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3945#true} {3945#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3945#true} is VALID [2022-04-27 21:34:12,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {3945#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3945#true} is VALID [2022-04-27 21:34:12,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {3945#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {3945#true} is VALID [2022-04-27 21:34:12,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {3945#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {3950#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {3950#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {3950#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {3950#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {3950#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {3950#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {3951#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {3952#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {3952#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [213] L191-->L203: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__i~0_18) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {3952#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:12,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {3952#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [217] L203-->L215: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~__tmp_13~0_1 (ite (< v_main_~main__j~0_15 v_main_~main__bufsize~0_8) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~11_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main__j~0=v_main_~main__j~0_15} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main__j~0=v_main_~main__j~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {3953#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-27 21:34:12,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {3953#(not (= main_~__VERIFIER_assert__cond~12 0))} [220] L215-->L217: Formula: (= v_main_~__VERIFIER_assert__cond~12_3 0) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3} OutVars{main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3} AuxVars[] AssignedVars[] {3946#false} is VALID [2022-04-27 21:34:12,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {3946#false} [222] L217-->mainErr12ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3946#false} is VALID [2022-04-27 21:34:12,469 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 21:34:12,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:12,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604264757] [2022-04-27 21:34:12,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604264757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:12,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:12,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327225427] [2022-04-27 21:34:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:12,469 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 21:34:12,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:12,470 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 21:34:12,481 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 21:34:12,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:12,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:12,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:12,482 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 21:34:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:12,725 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-27 21:34:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:34:12,726 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 21:34:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:12,726 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 21:34:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-27 21:34:12,727 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 21:34:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-27 21:34:12,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2022-04-27 21:34:12,785 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 21:34:12,785 INFO L225 Difference]: With dead ends: 62 [2022-04-27 21:34:12,785 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 21:34:12,786 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 21:34:12,786 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 114 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:12,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 63 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:34:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 21:34:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-04-27 21:34:12,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:12,804 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 21:34:12,804 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 21:34:12,804 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 21:34:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:12,805 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 21:34:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 21:34:12,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:12,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:12,806 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 21:34:12,806 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 21:34:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:12,806 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 21:34:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 21:34:12,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:12,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:12,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:12,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:12,807 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 21:34:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-27 21:34:12,807 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2022-04-27 21:34:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:12,808 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-27 21:34:12,808 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 21:34:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-27 21:34:12,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 21:34:12,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:12,808 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 21:34:12,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 21:34:12,808 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 21:34:12,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:12,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1290657461, now seen corresponding path program 1 times [2022-04-27 21:34:12,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:12,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937227134] [2022-04-27 21:34:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:12,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:12,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {4218#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {4210#true} is VALID [2022-04-27 21:34:12,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {4210#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4210#true} is VALID [2022-04-27 21:34:12,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4210#true} {4210#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4210#true} is VALID [2022-04-27 21:34:12,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {4210#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4218#(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 21:34:12,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {4218#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {4210#true} is VALID [2022-04-27 21:34:12,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {4210#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4210#true} is VALID [2022-04-27 21:34:12,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4210#true} {4210#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4210#true} is VALID [2022-04-27 21:34:12,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {4210#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4210#true} is VALID [2022-04-27 21:34:12,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {4210#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {4210#true} is VALID [2022-04-27 21:34:12,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {4210#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {4210#true} is VALID [2022-04-27 21:34:12,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {4210#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {4215#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:12,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {4215#(= main_~main__j~0 0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {4215#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:12,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {4215#(= main_~main__j~0 0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {4215#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:12,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {4215#(= main_~main__j~0 0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {4215#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:12,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {4215#(= main_~main__j~0 0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4215#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:12,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {4215#(= main_~main__j~0 0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {4215#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:12,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {4215#(= main_~main__j~0 0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {4215#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:12,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {4215#(= main_~main__j~0 0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {4215#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:12,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {4215#(= main_~main__j~0 0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {4215#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:12,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {4215#(= main_~main__j~0 0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {4215#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:12,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {4215#(= main_~main__j~0 0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {4216#(<= 1 main_~main__j~0)} is VALID [2022-04-27 21:34:12,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {4216#(<= 1 main_~main__j~0)} [213] L191-->L203: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__i~0_18) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {4216#(<= 1 main_~main__j~0)} is VALID [2022-04-27 21:34:12,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {4216#(<= 1 main_~main__j~0)} [217] L203-->L215: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~__tmp_13~0_1 (ite (< v_main_~main__j~0_15 v_main_~main__bufsize~0_8) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~11_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main__j~0=v_main_~main__j~0_15} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main__j~0=v_main_~main__j~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {4216#(<= 1 main_~main__j~0)} is VALID [2022-04-27 21:34:12,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {4216#(<= 1 main_~main__j~0)} [221] L215-->L227: Formula: (and (= (ite (<= 0 v_main_~main__j~0_16) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {4217#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 21:34:12,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {4217#(not (= main_~__VERIFIER_assert__cond~13 0))} [224] L227-->L229: Formula: (= v_main_~__VERIFIER_assert__cond~13_3 0) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} AuxVars[] AssignedVars[] {4211#false} is VALID [2022-04-27 21:34:12,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {4211#false} [226] L229-->mainErr13ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4211#false} is VALID [2022-04-27 21:34:12,854 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 21:34:12,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:12,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937227134] [2022-04-27 21:34:12,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937227134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:12,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:12,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:34:12,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967017650] [2022-04-27 21:34:12,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:12,855 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 21:34:12,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:12,855 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 21:34:12,868 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 21:34:12,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:34:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:12,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:34:12,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:34:12,868 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 21:34:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:13,195 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-27 21:34:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:34:13,195 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 21:34:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:13,195 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 21:34:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-27 21:34:13,196 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 21:34:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-27 21:34:13,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-27 21:34:13,277 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 21:34:13,278 INFO L225 Difference]: With dead ends: 87 [2022-04-27 21:34:13,278 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 21:34:13,278 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 21:34:13,279 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 21:34:13,279 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 21:34:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 21:34:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2022-04-27 21:34:13,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:13,296 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 21:34:13,296 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 21:34:13,296 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 21:34:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:13,297 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-27 21:34:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-27 21:34:13,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:13,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:13,298 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 21:34:13,298 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 21:34:13,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:13,299 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-27 21:34:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-27 21:34:13,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:13,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:13,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:13,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:13,299 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 21:34:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 21:34:13,299 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2022-04-27 21:34:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:13,300 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 21:34:13,300 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 21:34:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 21:34:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 21:34:13,300 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:13,300 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 21:34:13,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 21:34:13,300 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 21:34:13,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:13,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1355674374, now seen corresponding path program 1 times [2022-04-27 21:34:13,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:13,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79353876] [2022-04-27 21:34:13,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:13,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:13,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:13,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {4554#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {4545#true} is VALID [2022-04-27 21:34:13,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {4545#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4545#true} is VALID [2022-04-27 21:34:13,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4545#true} {4545#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4545#true} is VALID [2022-04-27 21:34:13,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {4545#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4554#(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 21:34:13,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {4554#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {4545#true} is VALID [2022-04-27 21:34:13,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {4545#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4545#true} is VALID [2022-04-27 21:34:13,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4545#true} {4545#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4545#true} is VALID [2022-04-27 21:34:13,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {4545#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4545#true} is VALID [2022-04-27 21:34:13,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {4545#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {4545#true} is VALID [2022-04-27 21:34:13,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {4545#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {4550#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {4550#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {4550#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {4550#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {4550#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {4550#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {4551#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {4552#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {4552#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [213] L191-->L203: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__i~0_18) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {4552#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {4552#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [217] L203-->L215: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~__tmp_13~0_1 (ite (< v_main_~main__j~0_15 v_main_~main__bufsize~0_8) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~11_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main__j~0=v_main_~main__j~0_15} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main__j~0=v_main_~main__j~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {4552#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {4552#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [221] L215-->L227: Formula: (and (= (ite (<= 0 v_main_~main__j~0_16) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {4552#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 21:34:13,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {4552#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} [225] L227-->L243: Formula: (and (= v_main_~main____CPAchecker_TMP_4~0_1 v_main_~main__i~0_20) (= (+ v_main_~main__j~0_18 1) v_main_~main__j~0_17) (= v_main_~main____CPAchecker_TMP_3~0_1 v_main_~main__j~0_18) (not (= v_main_~__VERIFIER_assert__cond~13_4 0)) (= (+ v_main_~main__i~0_20 1) v_main_~main__i~0_19) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1) (= (ite (< v_main_~main__j~0_17 v_main_~main__bufsize~0_9) 1 0) v_main_~__tmp_15~0_1)) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_9, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main__j~0=v_main_~main__j~0_18, main_~main__i~0=v_main_~main__i~0_20} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_9, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__j~0=v_main_~main__j~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1, main_~main__i~0=v_main_~main__i~0_19, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14, main_~main__j~0, main_~main____CPAchecker_TMP_3~0, main_~main__i~0, main_~main____CPAchecker_TMP_4~0] {4553#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-27 21:34:13,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {4553#(not (= main_~__VERIFIER_assert__cond~14 0))} [228] L243-->L245: Formula: (= v_main_~__VERIFIER_assert__cond~14_3 0) InVars {main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} OutVars{main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} AuxVars[] AssignedVars[] {4546#false} is VALID [2022-04-27 21:34:13,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {4546#false} [230] L245-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4546#false} is VALID [2022-04-27 21:34:13,359 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 21:34:13,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:13,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79353876] [2022-04-27 21:34:13,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79353876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:13,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:13,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:13,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824203876] [2022-04-27 21:34:13,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:13,360 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 21:34:13,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:13,360 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 21:34:13,374 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 21:34:13,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:13,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:13,375 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 21:34:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:13,662 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 21:34:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:34:13,663 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 21:34:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:13,663 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 21:34:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-27 21:34:13,664 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 21:34:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-27 21:34:13,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2022-04-27 21:34:13,719 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 21:34:13,720 INFO L225 Difference]: With dead ends: 60 [2022-04-27 21:34:13,720 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 21:34:13,720 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 21:34:13,721 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 99 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:13,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 58 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:34:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 21:34:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2022-04-27 21:34:13,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:13,736 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 21:34:13,736 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 21:34:13,736 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 21:34:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:13,737 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-27 21:34:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-27 21:34:13,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:13,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:13,738 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 21:34:13,738 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 21:34:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:13,738 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-27 21:34:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-27 21:34:13,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:13,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:13,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:13,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:13,739 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 21:34:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 21:34:13,739 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2022-04-27 21:34:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:13,739 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 21:34:13,739 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 21:34:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 21:34:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 21:34:13,740 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:34:13,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, 1, 1] [2022-04-27 21:34:13,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 21:34:13,740 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 21:34:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:34:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash 923768623, now seen corresponding path program 1 times [2022-04-27 21:34:13,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:34:13,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446405399] [2022-04-27 21:34:13,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:34:13,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:34:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:13,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:34:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:34:13,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {4809#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {4800#true} is VALID [2022-04-27 21:34:13,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {4800#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4800#true} is VALID [2022-04-27 21:34:13,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4800#true} {4800#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4800#true} is VALID [2022-04-27 21:34:13,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {4800#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4809#(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 21:34:13,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {4809#(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|))} [154] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_main~0_18 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~__return_334~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_334~0=v_~__return_334~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_334~0, #NULL.base] {4800#true} is VALID [2022-04-27 21:34:13,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {4800#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4800#true} is VALID [2022-04-27 21:34:13,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4800#true} {4800#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4800#true} is VALID [2022-04-27 21:34:13,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {4800#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4800#true} is VALID [2022-04-27 21:34:13,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {4800#true} [156] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__bufsize~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__len~0=v_main_~main__len~0_2, main_~main__bufsize~0=v_main_~main__bufsize~0_1, main_~main__j~0=v_main_~main__j~0_4, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__bufsize~0, main_~main__len~0, main_~main__j~0, main_~main__i~0] {4800#true} is VALID [2022-04-27 21:34:13,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {4800#true} [159] L20-->L304: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= (+ v_main_~main__bufsize~0_5 (- 4)) v_main_~main__limit~0_2) (not (< v_main_~main__bufsize~0_5 0)) (= |v_main_#t~nondet5_2| v_main_~main__len~0_5) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= 0 v_main_~main__i~0_5)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__bufsize~0=v_main_~main__bufsize~0_5} OutVars{main_~main__limit~0=v_main_~main__limit~0_2, main_~main__len~0=v_main_~main__len~0_5, main_~main__bufsize~0=v_main_~main__bufsize~0_5, main_~main__i~0=v_main_~main__i~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_~main__limit~0, main_~main__len~0, main_~main__i~0] {4800#true} is VALID [2022-04-27 21:34:13,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {4800#true} [161] L304-->L264: Formula: (and (< v_main_~main__i~0_6 v_main_~main__len~0_6) (= 0 v_main_~main__j~0_5)) InVars {main_~main__len~0=v_main_~main__len~0_6, main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__len~0=v_main_~main__len~0_6, main_~main__j~0=v_main_~main__j~0_5, main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[main_~main__j~0] {4805#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:13,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {4805#(= main_~main__j~0 0)} [163] L264-->L36: Formula: (< v_main_~main__i~0_7 v_main_~main__len~0_7) InVars {main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__len~0=v_main_~main__len~0_7, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[] {4805#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:13,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {4805#(= main_~main__j~0 0)} [165] L36-->L38: Formula: (< v_main_~main__j~0_6 v_main_~main__limit~0_3) InVars {main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} OutVars{main_~main__limit~0=v_main_~main__limit~0_3, main_~main__j~0=v_main_~main__j~0_6} AuxVars[] AssignedVars[] {4805#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:13,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {4805#(= main_~main__j~0 0)} [167] L38-->L45: Formula: (let ((.cse0 (< (+ v_main_~main__i~0_8 1) v_main_~main__len~0_8))) (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) .cse0 (= (ite .cse0 1 0) v_main_~__tmp_1~0_1))) InVars {main_~main__len~0=v_main_~main__len~0_8, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__len~0=v_main_~main__len~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {4805#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:13,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {4805#(= main_~main__j~0 0)} [170] L45-->L57: Formula: (and (= (ite (<= 0 v_main_~main__i~0_9) 1 0) v_main_~__tmp_2~0_1) (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__i~0=v_main_~main__i~0_9} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~__tmp_2~0=v_main_~__tmp_2~0_1, main_~main__i~0=v_main_~main__i~0_9} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4805#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:13,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {4805#(= main_~main__j~0 0)} [175] L57-->L66: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet6_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~0] {4805#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:13,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {4805#(= main_~main__j~0 0)} [181] L66-->L139: Formula: (and (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= (ite (< v_main_~main__i~0_14 v_main_~main__len~0_10) 1 0) v_main_~__tmp_7~0_1) (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main__len~0=v_main_~main__len~0_10, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~main__i~0=v_main_~main__i~0_14} OutVars{main_~main__len~0=v_main_~main__len~0_10, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__i~0=v_main_~main__i~0_14} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {4805#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:13,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {4805#(= main_~main__j~0 0)} [187] L139-->L151: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= (ite (<= 0 v_main_~main__i~0_15) 1 0) v_main_~__tmp_8~0_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__i~0=v_main_~main__i~0_15} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1, main_~main__i~0=v_main_~main__i~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {4805#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:13,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {4805#(= main_~main__j~0 0)} [195] L151-->L163: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1) (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__j~0_11 v_main_~main__bufsize~0_7) 1 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__bufsize~0=v_main_~main__bufsize~0_7, main_~main__j~0=v_main_~main__j~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {4805#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:13,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {4805#(= main_~main__j~0 0)} [203] L163-->L175: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__j~0_12) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__j~0=v_main_~main__j~0_12, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {4805#(= main_~main__j~0 0)} is VALID [2022-04-27 21:34:13,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {4805#(= main_~main__j~0 0)} [209] L175-->L191: Formula: (and (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__i~0_17) (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (+ v_main_~main__i~0_17 1) v_main_~main__i~0_16) (= (ite (< v_main_~main__i~0_16 v_main_~main__len~0_11) 1 0) v_main_~__tmp_11~0_1) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__j~0_14) (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) (= (+ v_main_~main__j~0_14 1) v_main_~main__j~0_13)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main__j~0=v_main_~main__j~0_14, main_~main__i~0=v_main_~main__i~0_17} OutVars{main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4, main_~main__len~0=v_main_~main__len~0_11, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__j~0=v_main_~main__j~0_13, main_~__tmp_11~0=v_main_~__tmp_11~0_1, main_~main__i~0=v_main_~main__i~0_16} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~__VERIFIER_assert__cond~10, main_~main____CPAchecker_TMP_1~0, main_~main__j~0, main_~__tmp_11~0, main_~main__i~0] {4806#(<= 1 main_~main__j~0)} is VALID [2022-04-27 21:34:13,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {4806#(<= 1 main_~main__j~0)} [213] L191-->L203: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__i~0_18) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4, main_~main__i~0=v_main_~main__i~0_18} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {4806#(<= 1 main_~main__j~0)} is VALID [2022-04-27 21:34:13,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {4806#(<= 1 main_~main__j~0)} [217] L203-->L215: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~__tmp_13~0_1 (ite (< v_main_~main__j~0_15 v_main_~main__bufsize~0_8) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~11_4 0))) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main__j~0=v_main_~main__j~0_15} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_8, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main__j~0=v_main_~main__j~0_15} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {4806#(<= 1 main_~main__j~0)} is VALID [2022-04-27 21:34:13,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {4806#(<= 1 main_~main__j~0)} [221] L215-->L227: Formula: (and (= (ite (<= 0 v_main_~main__j~0_16) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__j~0=v_main_~main__j~0_16} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {4806#(<= 1 main_~main__j~0)} is VALID [2022-04-27 21:34:13,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {4806#(<= 1 main_~main__j~0)} [225] L227-->L243: Formula: (and (= v_main_~main____CPAchecker_TMP_4~0_1 v_main_~main__i~0_20) (= (+ v_main_~main__j~0_18 1) v_main_~main__j~0_17) (= v_main_~main____CPAchecker_TMP_3~0_1 v_main_~main__j~0_18) (not (= v_main_~__VERIFIER_assert__cond~13_4 0)) (= (+ v_main_~main__i~0_20 1) v_main_~main__i~0_19) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1) (= (ite (< v_main_~main__j~0_17 v_main_~main__bufsize~0_9) 1 0) v_main_~__tmp_15~0_1)) InVars {main_~main__bufsize~0=v_main_~main__bufsize~0_9, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main__j~0=v_main_~main__j~0_18, main_~main__i~0=v_main_~main__i~0_20} OutVars{main_~main__bufsize~0=v_main_~main__bufsize~0_9, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__j~0=v_main_~main__j~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1, main_~main__i~0=v_main_~main__i~0_19, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14, main_~main__j~0, main_~main____CPAchecker_TMP_3~0, main_~main__i~0, main_~main____CPAchecker_TMP_4~0] {4807#(<= 2 main_~main__j~0)} is VALID [2022-04-27 21:34:13,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {4807#(<= 2 main_~main__j~0)} [229] L243-->L255: Formula: (and (= v_main_~__tmp_16~0_1 (ite (<= 0 v_main_~main__j~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~14_4 0)) (= v_main_~__tmp_16~0_1 v_main_~__VERIFIER_assert__cond~15_3)) InVars {main_~main__j~0=v_main_~main__j~0_19, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_3, main_~__tmp_16~0=v_main_~__tmp_16~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__j~0=v_main_~main__j~0_19} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {4808#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-27 21:34:13,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {4808#(not (= main_~__VERIFIER_assert__cond~15 0))} [232] L255-->L257: Formula: (= v_main_~__VERIFIER_assert__cond~15_1 0) InVars {main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1} AuxVars[] AssignedVars[] {4801#false} is VALID [2022-04-27 21:34:13,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {4801#false} [234] L257-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4801#false} is VALID [2022-04-27 21:34:13,826 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 21:34:13,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:34:13,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446405399] [2022-04-27 21:34:13,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446405399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:34:13,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:34:13,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:34:13,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963999239] [2022-04-27 21:34:13,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:34:13,827 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 21:34:13,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:34:13,827 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 21:34:13,842 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 21:34:13,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:34:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:34:13,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:34:13,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:34:13,843 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 21:34:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:14,373 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2022-04-27 21:34:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:34:14,373 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 21:34:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:34:14,373 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 21:34:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-27 21:34:14,374 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 21:34:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-04-27 21:34:14,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-04-27 21:34:14,494 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 21:34:14,495 INFO L225 Difference]: With dead ends: 125 [2022-04-27 21:34:14,495 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:34:14,495 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 21:34:14,496 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 161 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:34:14,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 79 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:34:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:34:14,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:34:14,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:34:14,496 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 21:34:14,496 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 21:34:14,496 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 21:34:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:14,497 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:34:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:34:14,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:14,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:14,497 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 21:34:14,497 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 21:34:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:34:14,497 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:34:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:34:14,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:14,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:34:14,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:34:14,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:34:14,497 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 21:34:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:34:14,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-04-27 21:34:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:34:14,498 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:34:14,498 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 21:34:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:34:14,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:34:14,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-27 21:34:14,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-27 21:34:14,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-27 21:34:14,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-27 21:34:14,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-27 21:34:14,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-27 21:34:14,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-27 21:34:14,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-27 21:34:14,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-27 21:34:14,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-27 21:34:14,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-27 21:34:14,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-27 21:34:14,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-27 21:34:14,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-27 21:34:14,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-27 21:34:14,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-27 21:34:14,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 21:34:14,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:35:12,548 WARN L232 SmtUtils]: Spent 58.04s on a formula simplification that was a NOOP. DAG size: 179 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 21:38:18,147 WARN L232 SmtUtils]: Spent 3.09m 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)