/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/automizer/LoopAccelerationJordanC.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 16:13:36,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:13:36,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:13:37,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:13:37,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:13:37,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:13:37,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:13:37,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:13:37,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:13:37,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:13:37,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:13:37,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:13:37,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:13:37,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:13:37,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:13:37,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:13:37,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:13:37,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:13:37,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:13:37,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:13:37,074 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:13:37,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:13:37,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:13:37,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:13:37,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:13:37,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:13:37,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:13:37,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:13:37,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:13:37,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:13:37,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:13:37,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:13:37,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:13:37,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:13:37,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:13:37,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:13:37,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:13:37,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:13:37,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:13:37,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:13:37,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:13:37,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:13:37,089 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:13:37,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:13:37,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:13:37,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:13:37,109 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:13:37,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:13:37,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:13:37,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:13:37,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:13:37,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:13:37,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:13:37,110 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:13:37,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:13:37,110 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:13:37,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:13:37,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:13:37,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:13:37,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:13:37,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:13:37,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:13:37,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:13:37,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:13:37,111 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:13:37,112 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 16:13:37,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:13:37,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:13:37,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:13:37,357 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:13:37,358 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:13:37,358 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 16:13:37,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c816867d8/f0d25b2641374cca9980936e9b28a101/FLAGa5594f059 [2022-04-27 16:13:37,770 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:13:37,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2022-04-27 16:13:37,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c816867d8/f0d25b2641374cca9980936e9b28a101/FLAGa5594f059 [2022-04-27 16:13:37,785 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c816867d8/f0d25b2641374cca9980936e9b28a101 [2022-04-27 16:13:37,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:13:37,788 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:13:37,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:13:37,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:13:37,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:13:37,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:13:37" (1/1) ... [2022-04-27 16:13:37,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345b8bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:37, skipping insertion in model container [2022-04-27 16:13:37,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:13:37" (1/1) ... [2022-04-27 16:13:37,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:13:37,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:13:37,996 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 16:13:38,013 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 16:13:38,015 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 16:13:38,016 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 16:13:38,017 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 16:13:38,018 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 16:13:38,019 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 16:13:38,020 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 16:13:38,021 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 16:13:38,022 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 16:13:38,036 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 16:13:38,037 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 16:13:38,038 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 16:13:38,039 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 16:13:38,041 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 16:13:38,042 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 16:13:38,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:13:38,062 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:13:38,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 16:13:38,073 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 16:13:38,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[1613,1626] [2022-04-27 16:13:38,075 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 16:13:38,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[2024,2037] [2022-04-27 16:13:38,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[2224,2237] [2022-04-27 16:13:38,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[2629,2642] [2022-04-27 16:13:38,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[2829,2842] [2022-04-27 16:13:38,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[3040,3053] [2022-04-27 16:13:38,084 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 16:13:38,085 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 16:13:38,086 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 16:13:38,086 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 16:13:38,087 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 16:13:38,088 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 16:13:38,089 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 16:13:38,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:13:38,099 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:13:38,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:38 WrapperNode [2022-04-27 16:13:38,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:13:38,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:13:38,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:13:38,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:13:38,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:38" (1/1) ... [2022-04-27 16:13:38,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:38" (1/1) ... [2022-04-27 16:13:38,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:38" (1/1) ... [2022-04-27 16:13:38,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:38" (1/1) ... [2022-04-27 16:13:38,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:38" (1/1) ... [2022-04-27 16:13:38,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:38" (1/1) ... [2022-04-27 16:13:38,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:38" (1/1) ... [2022-04-27 16:13:38,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:13:38,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:13:38,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:13:38,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:13:38,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:38" (1/1) ... [2022-04-27 16:13:38,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:13:38,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:13:38,151 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 16:13:38,166 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 16:13:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:13:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:13:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:13:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:13:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:13:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:13:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:13:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:13:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:13:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:13:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:13:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:13:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:13:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:13:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:13:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:13:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:13:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:13:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:13:38,233 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:13:38,235 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:13:38,426 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:13:38,433 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:13:38,433 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 16:13:38,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:13:38 BoogieIcfgContainer [2022-04-27 16:13:38,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:13:38,452 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:13:38,453 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:13:38,453 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:13:38,456 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:13:38" (1/1) ... [2022-04-27 16:13:38,457 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:13:38,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:13:38 BasicIcfg [2022-04-27 16:13:38,526 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:13:38,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:13:38,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:13:38,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:13:38,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:13:37" (1/4) ... [2022-04-27 16:13:38,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514a6f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:13:38, skipping insertion in model container [2022-04-27 16:13:38,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:38" (2/4) ... [2022-04-27 16:13:38,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514a6f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:13:38, skipping insertion in model container [2022-04-27 16:13:38,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:13:38" (3/4) ... [2022-04-27 16:13:38,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514a6f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:13:38, skipping insertion in model container [2022-04-27 16:13:38,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:13:38" (4/4) ... [2022-04-27 16:13:38,532 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.cJordan [2022-04-27 16:13:38,546 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:13:38,546 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-27 16:13:38,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:13:38,596 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1306c21a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22bdeb86 [2022-04-27 16:13:38,598 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-27 16:13:38,609 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 16:13:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:13:38,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:38,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:38,616 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 16:13:38,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:38,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2053356655, now seen corresponding path program 1 times [2022-04-27 16:13:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:38,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882996312] [2022-04-27 16:13:38,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:38,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:38,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:38,863 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 16:13:38,864 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 16:13:38,864 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 16:13:38,866 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 16:13:38,866 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 16:13:38,867 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 16:13:38,867 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 16:13:38,867 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 16:13:38,867 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 16:13:38,868 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 16:13:38,868 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 16:13:38,868 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 16:13:38,868 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 16:13:38,870 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 16:13:38,872 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 16:13:38,872 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 16:13:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:13:38,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:38,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882996312] [2022-04-27 16:13:38,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882996312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:38,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:38,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:13:38,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557880440] [2022-04-27 16:13:38,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:38,879 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 16:13:38,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:38,882 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 16:13:38,906 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 16:13:38,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:13:38,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:13:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:13:38,926 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 16:13:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:39,141 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-27 16:13:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:13:39,142 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 16:13:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:39,143 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 16:13:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-04-27 16:13:39,149 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 16:13:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-04-27 16:13:39,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 113 transitions. [2022-04-27 16:13:39,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:39,248 INFO L225 Difference]: With dead ends: 84 [2022-04-27 16:13:39,248 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 16:13:39,249 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 16:13:39,251 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 117 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:39,252 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.1s Time] [2022-04-27 16:13:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 16:13:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2022-04-27 16:13:39,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:39,270 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 16:13:39,271 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 16:13:39,271 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 16:13:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:39,275 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-27 16:13:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-27 16:13:39,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:39,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:39,276 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 16:13:39,276 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 16:13:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:39,279 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-27 16:13:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-27 16:13:39,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:39,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:39,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:39,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:39,281 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 16:13:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-27 16:13:39,283 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2022-04-27 16:13:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:39,283 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-27 16:13:39,283 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 16:13:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-27 16:13:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:13:39,284 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:39,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:39,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:13:39,284 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 16:13:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:39,285 INFO L85 PathProgramCache]: Analyzing trace with hash 770454336, now seen corresponding path program 1 times [2022-04-27 16:13:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:39,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703952194] [2022-04-27 16:13:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:39,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#(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] {375#true} is VALID [2022-04-27 16:13:39,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {375#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#true} is VALID [2022-04-27 16:13:39,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#true} is VALID [2022-04-27 16:13:39,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {375#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#(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 16:13:39,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#(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] {375#true} is VALID [2022-04-27 16:13:39,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {375#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#true} is VALID [2022-04-27 16:13:39,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {375#true} {375#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#true} is VALID [2022-04-27 16:13:39,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {375#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#true} is VALID [2022-04-27 16:13:39,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {375#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] {375#true} is VALID [2022-04-27 16:13:39,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#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] {380#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:39,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {380#(<= 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] {380#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:39,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {380#(<= 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[] {380#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:39,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#(<= 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[] {380#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:39,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {380#(<= 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] {380#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:39,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {380#(<= 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] {381#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 16:13:39,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {381#(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[] {376#false} is VALID [2022-04-27 16:13:39,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {376#false} [178] L59-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {376#false} is VALID [2022-04-27 16:13:39,348 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 16:13:39,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:39,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703952194] [2022-04-27 16:13:39,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703952194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:39,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:39,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:13:39,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240738076] [2022-04-27 16:13:39,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:39,350 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 16:13:39,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:39,350 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 16:13:39,360 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 16:13:39,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:13:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:39,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:13:39,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:13:39,361 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 16:13:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:39,533 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-27 16:13:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:13:39,533 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 16:13:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:39,533 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 16:13:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-04-27 16:13:39,535 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 16:13:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-04-27 16:13:39,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 83 transitions. [2022-04-27 16:13:39,603 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 16:13:39,605 INFO L225 Difference]: With dead ends: 75 [2022-04-27 16:13:39,605 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 16:13:39,605 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 16:13:39,606 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 150 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:39,606 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.1s Time] [2022-04-27 16:13:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 16:13:39,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2022-04-27 16:13:39,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:39,609 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 16:13:39,610 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 16:13:39,610 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 16:13:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:39,612 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-27 16:13:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-27 16:13:39,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:39,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:39,613 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 16:13:39,613 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 16:13:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:39,615 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-27 16:13:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-27 16:13:39,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:39,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:39,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:39,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:39,616 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 16:13:39,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-04-27 16:13:39,617 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 14 [2022-04-27 16:13:39,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:39,617 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-04-27 16:13:39,617 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 16:13:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-27 16:13:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:13:39,618 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:39,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:39,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:13:39,618 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 16:13:39,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:39,619 INFO L85 PathProgramCache]: Analyzing trace with hash 770485154, now seen corresponding path program 1 times [2022-04-27 16:13:39,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:39,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317116540] [2022-04-27 16:13:39,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:39,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:39,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:39,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#(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] {671#true} is VALID [2022-04-27 16:13:39,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 16:13:39,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {671#true} {671#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 16:13:39,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {671#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {678#(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 16:13:39,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#(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] {671#true} is VALID [2022-04-27 16:13:39,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 16:13:39,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {671#true} {671#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 16:13:39,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {671#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#true} is VALID [2022-04-27 16:13:39,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {671#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] {671#true} is VALID [2022-04-27 16:13:39,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {671#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] {671#true} is VALID [2022-04-27 16:13:39,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#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] {676#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 16:13:39,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {676#(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[] {676#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 16:13:39,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {676#(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[] {676#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 16:13:39,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {676#(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[] {676#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 16:13:39,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {676#(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] {677#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-27 16:13:39,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {677#(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[] {672#false} is VALID [2022-04-27 16:13:39,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {672#false} [182] L76-->mainErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#false} is VALID [2022-04-27 16:13:39,670 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 16:13:39,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:39,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317116540] [2022-04-27 16:13:39,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317116540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:39,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:39,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:13:39,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251651290] [2022-04-27 16:13:39,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:39,671 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 16:13:39,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:39,671 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 16:13:39,681 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 16:13:39,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:13:39,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:39,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:13:39,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:13:39,682 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 16:13:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:39,935 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-04-27 16:13:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:13:39,935 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 16:13:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:39,935 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 16:13:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-04-27 16:13:39,937 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 16:13:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-04-27 16:13:39,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 108 transitions. [2022-04-27 16:13:40,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:40,030 INFO L225 Difference]: With dead ends: 97 [2022-04-27 16:13:40,030 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 16:13:40,031 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 16:13:40,031 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 16:13:40,032 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 16:13:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 16:13:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2022-04-27 16:13:40,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:40,035 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 16:13:40,035 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 16:13:40,035 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 16:13:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:40,037 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-04-27 16:13:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-04-27 16:13:40,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:40,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:40,038 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 16:13:40,038 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 16:13:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:40,041 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-04-27 16:13:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-04-27 16:13:40,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:40,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:40,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:40,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:40,041 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 16:13:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-27 16:13:40,043 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2022-04-27 16:13:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:40,043 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-27 16:13:40,043 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 16:13:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-27 16:13:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:13:40,043 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:40,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:40,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:13:40,044 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 16:13:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1884762791, now seen corresponding path program 1 times [2022-04-27 16:13:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:40,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961268599] [2022-04-27 16:13:40,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:40,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:40,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:40,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {1041#(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] {1034#true} is VALID [2022-04-27 16:13:40,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {1034#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#true} is VALID [2022-04-27 16:13:40,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1034#true} {1034#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#true} is VALID [2022-04-27 16:13:40,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {1034#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1041#(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 16:13:40,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {1041#(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] {1034#true} is VALID [2022-04-27 16:13:40,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {1034#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#true} is VALID [2022-04-27 16:13:40,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#true} is VALID [2022-04-27 16:13:40,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {1034#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#true} is VALID [2022-04-27 16:13:40,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {1034#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] {1034#true} is VALID [2022-04-27 16:13:40,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {1034#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] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:40,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {1039#(<= 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] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:40,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {1039#(<= 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[] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:40,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {1039#(<= 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[] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:40,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {1039#(<= 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[] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:40,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {1039#(<= 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] {1039#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:40,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {1039#(<= 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] {1040#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-27 16:13:40,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {1040#(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[] {1035#false} is VALID [2022-04-27 16:13:40,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {1035#false} [188] L88-->mainErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1035#false} is VALID [2022-04-27 16:13:40,164 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 16:13:40,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:40,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961268599] [2022-04-27 16:13:40,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961268599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:40,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:40,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:13:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474801138] [2022-04-27 16:13:40,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:40,165 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 16:13:40,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:40,165 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 16:13:40,173 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 16:13:40,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:13:40,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:40,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:13:40,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:13:40,174 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 16:13:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:40,360 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-27 16:13:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:13:40,360 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 16:13:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:40,360 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 16:13:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-04-27 16:13:40,361 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 16:13:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-04-27 16:13:40,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 101 transitions. [2022-04-27 16:13:40,441 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 16:13:40,442 INFO L225 Difference]: With dead ends: 94 [2022-04-27 16:13:40,442 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 16:13:40,443 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 16:13:40,444 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 16:13:40,444 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 16:13:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 16:13:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2022-04-27 16:13:40,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:40,447 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 16:13:40,447 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 16:13:40,447 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 16:13:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:40,449 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-27 16:13:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-27 16:13:40,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:40,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:40,449 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 16:13:40,450 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 16:13:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:40,452 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-27 16:13:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-27 16:13:40,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:40,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:40,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:40,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:40,452 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 16:13:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-27 16:13:40,453 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2022-04-27 16:13:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:40,453 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-27 16:13:40,454 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 16:13:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 16:13:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:13:40,454 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:40,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:40,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 16:13:40,454 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 16:13:40,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:40,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1672280616, now seen corresponding path program 1 times [2022-04-27 16:13:40,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:40,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436675515] [2022-04-27 16:13:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:40,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:40,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:40,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {1391#(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] {1384#true} is VALID [2022-04-27 16:13:40,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {1384#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#true} is VALID [2022-04-27 16:13:40,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1384#true} {1384#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#true} is VALID [2022-04-27 16:13:40,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {1384#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1391#(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 16:13:40,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {1391#(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] {1384#true} is VALID [2022-04-27 16:13:40,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {1384#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#true} is VALID [2022-04-27 16:13:40,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1384#true} {1384#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#true} is VALID [2022-04-27 16:13:40,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {1384#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#true} is VALID [2022-04-27 16:13:40,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {1384#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] {1384#true} is VALID [2022-04-27 16:13:40,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {1384#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] {1384#true} is VALID [2022-04-27 16:13:40,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {1384#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] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 16:13:40,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {1389#(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[] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 16:13:40,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {1389#(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[] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 16:13:40,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {1389#(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] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 16:13:40,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {1389#(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] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 16:13:40,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {1389#(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] {1389#(not (<= main_~main__len~0 main_~main__i~0))} is VALID [2022-04-27 16:13:40,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {1389#(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] {1390#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-27 16:13:40,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#(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[] {1385#false} is VALID [2022-04-27 16:13:40,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {1385#false} [192] L141-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1385#false} is VALID [2022-04-27 16:13:40,503 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 16:13:40,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:40,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436675515] [2022-04-27 16:13:40,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436675515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:40,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:40,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:13:40,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913879953] [2022-04-27 16:13:40,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:40,503 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 16:13:40,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:40,504 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 16:13:40,513 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 16:13:40,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:13:40,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:40,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:13:40,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:13:40,513 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 16:13:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:40,679 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-04-27 16:13:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:13:40,680 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 16:13:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:40,680 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 16:13:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-27 16:13:40,681 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 16:13:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-27 16:13:40,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-27 16:13:40,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:40,744 INFO L225 Difference]: With dead ends: 71 [2022-04-27 16:13:40,744 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 16:13:40,744 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 16:13:40,745 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 16:13:40,745 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 16:13:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 16:13:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2022-04-27 16:13:40,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:40,747 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 16:13:40,747 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 16:13:40,747 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 16:13:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:40,749 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-04-27 16:13:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-04-27 16:13:40,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:40,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:40,749 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 16:13:40,749 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 16:13:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:40,751 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-04-27 16:13:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-04-27 16:13:40,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:40,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:40,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:40,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:40,751 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 16:13:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-27 16:13:40,752 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2022-04-27 16:13:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:40,752 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-27 16:13:40,752 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 16:13:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-27 16:13:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:13:40,753 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:40,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:40,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 16:13:40,753 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 16:13:40,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1701896842, now seen corresponding path program 1 times [2022-04-27 16:13:40,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:40,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751927598] [2022-04-27 16:13:40,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:40,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:40,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:40,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {1673#(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] {1665#true} is VALID [2022-04-27 16:13:40,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1665#true} is VALID [2022-04-27 16:13:40,811 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1665#true} is VALID [2022-04-27 16:13:40,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {1665#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1673#(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 16:13:40,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {1673#(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] {1665#true} is VALID [2022-04-27 16:13:40,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {1665#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1665#true} is VALID [2022-04-27 16:13:40,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1665#true} {1665#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1665#true} is VALID [2022-04-27 16:13:40,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {1665#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1665#true} is VALID [2022-04-27 16:13:40,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {1665#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] {1665#true} is VALID [2022-04-27 16:13:40,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {1665#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] {1670#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:40,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {1670#(<= (+ 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] {1670#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:40,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {1670#(<= (+ 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[] {1670#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:40,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#(<= (+ 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[] {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:40,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {1671#(<= (+ 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[] {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:40,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {1671#(<= (+ 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] {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:40,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {1671#(<= (+ 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] {1671#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:40,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {1671#(<= (+ 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] {1672#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 16:13:40,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {1672#(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[] {1666#false} is VALID [2022-04-27 16:13:40,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {1666#false} [196] L100-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1666#false} is VALID [2022-04-27 16:13:40,818 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 16:13:40,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:40,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751927598] [2022-04-27 16:13:40,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751927598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:40,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:40,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:13:40,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025125510] [2022-04-27 16:13:40,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:40,819 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 16:13:40,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:40,819 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 16:13:40,844 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 16:13:40,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:13:40,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:40,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:13:40,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:13:40,845 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 16:13:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:41,141 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-27 16:13:41,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:13:41,141 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 16:13:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:41,141 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 16:13:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-04-27 16:13:41,142 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 16:13:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-04-27 16:13:41,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2022-04-27 16:13:41,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:41,222 INFO L225 Difference]: With dead ends: 89 [2022-04-27 16:13:41,222 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 16:13:41,222 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 16:13:41,223 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 16:13:41,223 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 16:13:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 16:13:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2022-04-27 16:13:41,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:41,225 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 16:13:41,226 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 16:13:41,226 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 16:13:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:41,227 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-27 16:13:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-27 16:13:41,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:41,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:41,227 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 16:13:41,228 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 16:13:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:41,229 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-27 16:13:41,229 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-27 16:13:41,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:41,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:41,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:41,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:41,230 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 16:13:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-27 16:13:41,230 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2022-04-27 16:13:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:41,230 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-27 16:13:41,231 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 16:13:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-27 16:13:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:13:41,231 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:41,231 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 16:13:41,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 16:13:41,231 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 16:13:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:41,231 INFO L85 PathProgramCache]: Analyzing trace with hash 301092767, now seen corresponding path program 1 times [2022-04-27 16:13:41,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:41,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915998307] [2022-04-27 16:13:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:41,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {2009#(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] {2001#true} is VALID [2022-04-27 16:13:41,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {2001#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-27 16:13:41,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2001#true} {2001#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-27 16:13:41,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {2001#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#(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 16:13:41,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {2009#(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] {2001#true} is VALID [2022-04-27 16:13:41,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {2001#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-27 16:13:41,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2001#true} {2001#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-27 16:13:41,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {2001#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2001#true} is VALID [2022-04-27 16:13:41,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {2001#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] {2001#true} is VALID [2022-04-27 16:13:41,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {2001#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] {2001#true} is VALID [2022-04-27 16:13:41,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {2001#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] {2001#true} is VALID [2022-04-27 16:13:41,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {2001#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[] {2001#true} is VALID [2022-04-27 16:13:41,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {2001#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[] {2001#true} is VALID [2022-04-27 16:13:41,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {2001#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] {2001#true} is VALID [2022-04-27 16:13:41,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {2001#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] {2006#(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 16:13:41,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {2006#(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] {2007#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:41,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {2007#(<= 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] {2007#(<= 0 main_~main__i~0)} is VALID [2022-04-27 16:13:41,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {2007#(<= 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] {2008#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 16:13:41,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {2008#(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[] {2002#false} is VALID [2022-04-27 16:13:41,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {2002#false} [200] L153-->mainErr7ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2002#false} is VALID [2022-04-27 16:13:41,342 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 16:13:41,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:41,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915998307] [2022-04-27 16:13:41,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915998307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:41,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:41,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:13:41,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66415191] [2022-04-27 16:13:41,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:41,343 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 16:13:41,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:41,343 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 16:13:41,353 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 16:13:41,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:13:41,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:41,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:13:41,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:13:41,353 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 16:13:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:41,595 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-04-27 16:13:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:13:41,595 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 16:13:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:41,596 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 16:13:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-04-27 16:13:41,597 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 16:13:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-04-27 16:13:41,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 86 transitions. [2022-04-27 16:13:41,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:41,666 INFO L225 Difference]: With dead ends: 77 [2022-04-27 16:13:41,666 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 16:13:41,666 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 16:13:41,667 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 16:13:41,667 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 16:13:41,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 16:13:41,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2022-04-27 16:13:41,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:41,669 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 16:13:41,669 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 16:13:41,669 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 16:13:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:41,670 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-04-27 16:13:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-04-27 16:13:41,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:41,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:41,671 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 16:13:41,671 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 16:13:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:41,672 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-04-27 16:13:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-04-27 16:13:41,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:41,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:41,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:41,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:41,673 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 16:13:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-27 16:13:41,673 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2022-04-27 16:13:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:41,674 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-27 16:13:41,674 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 16:13:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-27 16:13:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:13:41,674 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:41,674 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 16:13:41,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 16:13:41,674 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 16:13:41,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1219195777, now seen corresponding path program 1 times [2022-04-27 16:13:41,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:41,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948925203] [2022-04-27 16:13:41,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:41,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:41,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:41,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {2307#(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] {2300#true} is VALID [2022-04-27 16:13:41,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {2300#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#true} is VALID [2022-04-27 16:13:41,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2300#true} {2300#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#true} is VALID [2022-04-27 16:13:41,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {2300#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2307#(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 16:13:41,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {2307#(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] {2300#true} is VALID [2022-04-27 16:13:41,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {2300#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#true} is VALID [2022-04-27 16:13:41,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2300#true} {2300#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#true} is VALID [2022-04-27 16:13:41,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {2300#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2300#true} is VALID [2022-04-27 16:13:41,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {2300#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] {2300#true} is VALID [2022-04-27 16:13:41,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {2300#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] {2300#true} is VALID [2022-04-27 16:13:41,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {2300#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] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:41,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {2305#(<= 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[] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:41,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {2305#(<= 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[] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:41,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {2305#(<= 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[] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:41,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {2305#(<= 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] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:41,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {2305#(<= 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] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:41,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {2305#(<= 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] {2305#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:41,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {2305#(<= 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] {2306#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 16:13:41,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {2306#(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[] {2301#false} is VALID [2022-04-27 16:13:41,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {2301#false} [204] L112-->mainErr5ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2301#false} is VALID [2022-04-27 16:13:41,715 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 16:13:41,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:41,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948925203] [2022-04-27 16:13:41,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948925203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:41,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:41,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:13:41,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533275855] [2022-04-27 16:13:41,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:41,716 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 16:13:41,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:41,716 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 16:13:41,725 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 16:13:41,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:13:41,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:41,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:13:41,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:13:41,726 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 16:13:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:41,881 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-27 16:13:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:13:41,881 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 16:13:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:41,881 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 16:13:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-04-27 16:13:41,882 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 16:13:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-04-27 16:13:41,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2022-04-27 16:13:41,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:41,953 INFO L225 Difference]: With dead ends: 85 [2022-04-27 16:13:41,953 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 16:13:41,953 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 16:13:41,954 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 110 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 16:13:41,954 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 16:13:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 16:13:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2022-04-27 16:13:41,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:41,956 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 16:13:41,956 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 16:13:41,956 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 16:13:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:41,957 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-27 16:13:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-04-27 16:13:41,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:41,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:41,958 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 16:13:41,958 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 16:13:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:41,959 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-27 16:13:41,959 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-04-27 16:13:41,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:41,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:41,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:41,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:41,960 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 16:13:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-27 16:13:41,960 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2022-04-27 16:13:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:41,961 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-27 16:13:41,961 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 16:13:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-27 16:13:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 16:13:41,961 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:41,961 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 16:13:41,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 16:13:41,961 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 16:13:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash 743942414, now seen corresponding path program 1 times [2022-04-27 16:13:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:41,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034317169] [2022-04-27 16:13:41,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:41,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:42,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:42,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {2623#(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] {2615#true} is VALID [2022-04-27 16:13:42,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#true} is VALID [2022-04-27 16:13:42,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2615#true} {2615#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#true} is VALID [2022-04-27 16:13:42,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {2615#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2623#(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 16:13:42,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {2623#(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] {2615#true} is VALID [2022-04-27 16:13:42,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {2615#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#true} is VALID [2022-04-27 16:13:42,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#true} is VALID [2022-04-27 16:13:42,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {2615#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2615#true} is VALID [2022-04-27 16:13:42,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {2615#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] {2615#true} is VALID [2022-04-27 16:13:42,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {2615#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] {2620#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:42,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {2620#(<= (+ 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] {2620#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:42,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {2620#(<= (+ 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[] {2620#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:42,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {2620#(<= (+ 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[] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:42,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {2621#(<= (+ 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] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:42,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {2621#(<= (+ 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] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:42,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {2621#(<= (+ 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] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:42,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {2621#(<= (+ 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] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:42,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {2621#(<= (+ 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] {2621#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:42,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {2621#(<= (+ 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] {2622#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-27 16:13:42,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {2622#(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[] {2616#false} is VALID [2022-04-27 16:13:42,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {2616#false} [206] L165-->mainErr8ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2616#false} is VALID [2022-04-27 16:13:42,029 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 16:13:42,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:42,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034317169] [2022-04-27 16:13:42,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034317169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:42,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:42,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:13:42,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335192896] [2022-04-27 16:13:42,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:42,029 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 16:13:42,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:42,030 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 16:13:42,040 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 16:13:42,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:13:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:42,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:13:42,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:13:42,041 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 16:13:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:42,223 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 16:13:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:13:42,223 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 16:13:42,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:42,223 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 16:13:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-27 16:13:42,224 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 16:13:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-27 16:13:42,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-04-27 16:13:42,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:42,280 INFO L225 Difference]: With dead ends: 59 [2022-04-27 16:13:42,280 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 16:13:42,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-27 16:13:42,280 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 16:13:42,281 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 16:13:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 16:13:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-04-27 16:13:42,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:42,282 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 16:13:42,282 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 16:13:42,282 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 16:13:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:42,283 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 16:13:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 16:13:42,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:42,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:42,284 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 16:13:42,284 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 16:13:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:42,285 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 16:13:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 16:13:42,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:42,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:42,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:42,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:42,285 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 16:13:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-27 16:13:42,286 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2022-04-27 16:13:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:42,286 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-27 16:13:42,286 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 16:13:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-27 16:13:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 16:13:42,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:42,287 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 16:13:42,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 16:13:42,287 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 16:13:42,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:42,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1587379587, now seen corresponding path program 1 times [2022-04-27 16:13:42,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:42,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731128438] [2022-04-27 16:13:42,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:42,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:42,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:42,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {2862#(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] {2855#true} is VALID [2022-04-27 16:13:42,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {2855#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#true} is VALID [2022-04-27 16:13:42,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2855#true} {2855#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#true} is VALID [2022-04-27 16:13:42,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {2855#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2862#(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 16:13:42,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {2862#(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] {2855#true} is VALID [2022-04-27 16:13:42,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {2855#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#true} is VALID [2022-04-27 16:13:42,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2855#true} {2855#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#true} is VALID [2022-04-27 16:13:42,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {2855#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#true} is VALID [2022-04-27 16:13:42,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {2855#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] {2855#true} is VALID [2022-04-27 16:13:42,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {2855#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] {2855#true} is VALID [2022-04-27 16:13:42,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {2855#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] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:42,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {2860#(<= 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[] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:42,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {2860#(<= 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[] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:42,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {2860#(<= 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] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:42,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {2860#(<= 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] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:42,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {2860#(<= 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] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:42,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {2860#(<= 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] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:42,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {2860#(<= 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] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:42,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {2860#(<= 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] {2860#(<= 0 main_~main__j~0)} is VALID [2022-04-27 16:13:42,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {2860#(<= 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] {2861#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 16:13:42,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {2861#(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[] {2856#false} is VALID [2022-04-27 16:13:42,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {2856#false} [210] L177-->mainErr9ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2856#false} is VALID [2022-04-27 16:13:42,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 16:13:42,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:42,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731128438] [2022-04-27 16:13:42,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731128438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:42,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:42,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:13:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899086814] [2022-04-27 16:13:42,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:42,327 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 16:13:42,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:42,327 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 16:13:42,338 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 16:13:42,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:13:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:42,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:13:42,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:13:42,338 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 16:13:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:42,454 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 16:13:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:13:42,455 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 16:13:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:42,455 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 16:13:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 16:13:42,456 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 16:13:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 16:13:42,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-27 16:13:42,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:42,508 INFO L225 Difference]: With dead ends: 59 [2022-04-27 16:13:42,508 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 16:13:42,509 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 16:13:42,509 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 16:13:42,509 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 16:13:42,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 16:13:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2022-04-27 16:13:42,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:42,511 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 16:13:42,511 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 16:13:42,511 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 16:13:42,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:42,512 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 16:13:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 16:13:42,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:42,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:42,512 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 16:13:42,512 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 16:13:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:42,513 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 16:13:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 16:13:42,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:42,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:42,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:42,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:42,513 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 16:13:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-27 16:13:42,514 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2022-04-27 16:13:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:42,514 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-27 16:13:42,514 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 16:13:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 16:13:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 16:13:42,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:42,514 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 16:13:42,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 16:13:42,515 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 16:13:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:42,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1964128178, now seen corresponding path program 1 times [2022-04-27 16:13:42,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:42,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159571175] [2022-04-27 16:13:42,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:42,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:42,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {3095#(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] {3088#true} is VALID [2022-04-27 16:13:42,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {3088#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-27 16:13:42,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3088#true} {3088#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-27 16:13:42,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {3088#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3095#(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 16:13:42,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {3095#(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] {3088#true} is VALID [2022-04-27 16:13:42,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {3088#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-27 16:13:42,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3088#true} {3088#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-27 16:13:42,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {3088#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3088#true} is VALID [2022-04-27 16:13:42,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {3088#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] {3088#true} is VALID [2022-04-27 16:13:42,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {3088#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] {3088#true} is VALID [2022-04-27 16:13:42,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {3088#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] {3088#true} is VALID [2022-04-27 16:13:42,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {3088#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[] {3088#true} is VALID [2022-04-27 16:13:42,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {3088#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[] {3088#true} is VALID [2022-04-27 16:13:42,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {3088#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] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 16:13:42,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {3093#(<= (+ 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] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 16:13:42,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {3093#(<= (+ 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] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 16:13:42,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {3093#(<= (+ 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] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 16:13:42,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {3093#(<= (+ 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] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 16:13:42,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {3093#(<= (+ 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] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 16:13:42,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {3093#(<= (+ 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] {3093#(<= (+ 2 main_~main__i~0) main_~main__len~0)} is VALID [2022-04-27 16:13:42,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {3093#(<= (+ 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] {3094#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 16:13:42,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {3094#(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[] {3089#false} is VALID [2022-04-27 16:13:42,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {3089#false} [214] L193-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3089#false} is VALID [2022-04-27 16:13:42,563 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 16:13:42,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:42,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159571175] [2022-04-27 16:13:42,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159571175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:42,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:42,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:13:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434775925] [2022-04-27 16:13:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:42,564 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 16:13:42,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:42,564 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 16:13:42,575 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 16:13:42,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:13:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:13:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:13:42,575 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 16:13:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:42,740 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-27 16:13:42,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:13:42,740 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 16:13:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:42,741 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 16:13:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 16:13:42,741 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 16:13:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 16:13:42,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-27 16:13:42,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:42,800 INFO L225 Difference]: With dead ends: 67 [2022-04-27 16:13:42,800 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 16:13:42,800 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 16:13:42,800 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 16:13:42,801 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 16:13:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 16:13:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2022-04-27 16:13:42,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:42,802 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 16:13:42,802 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 16:13:42,802 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 16:13:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:42,803 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-27 16:13:42,803 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-27 16:13:42,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:42,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:42,804 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 16:13:42,804 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 16:13:42,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:42,804 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-27 16:13:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-04-27 16:13:42,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:42,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:42,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:42,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:42,823 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 16:13:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-27 16:13:42,823 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2022-04-27 16:13:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:42,824 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-27 16:13:42,824 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 16:13:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-27 16:13:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 16:13:42,824 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:42,824 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 16:13:42,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 16:13:42,824 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 16:13:42,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash 758432615, now seen corresponding path program 1 times [2022-04-27 16:13:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:42,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120022105] [2022-04-27 16:13:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:42,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {3354#(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] {3346#true} is VALID [2022-04-27 16:13:42,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {3346#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#true} is VALID [2022-04-27 16:13:42,864 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3346#true} {3346#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#true} is VALID [2022-04-27 16:13:42,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {3346#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3354#(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 16:13:42,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {3354#(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] {3346#true} is VALID [2022-04-27 16:13:42,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {3346#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#true} is VALID [2022-04-27 16:13:42,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3346#true} {3346#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#true} is VALID [2022-04-27 16:13:42,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {3346#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3346#true} is VALID [2022-04-27 16:13:42,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {3346#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] {3346#true} is VALID [2022-04-27 16:13:42,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {3346#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] {3351#(= main_~main__i~0 0)} is VALID [2022-04-27 16:13:42,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {3351#(= 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] {3351#(= main_~main__i~0 0)} is VALID [2022-04-27 16:13:42,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {3351#(= 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[] {3351#(= main_~main__i~0 0)} is VALID [2022-04-27 16:13:42,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {3351#(= 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[] {3351#(= main_~main__i~0 0)} is VALID [2022-04-27 16:13:42,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {3351#(= 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] {3351#(= main_~main__i~0 0)} is VALID [2022-04-27 16:13:42,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {3351#(= 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] {3351#(= main_~main__i~0 0)} is VALID [2022-04-27 16:13:42,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {3351#(= 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] {3351#(= main_~main__i~0 0)} is VALID [2022-04-27 16:13:42,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {3351#(= 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] {3351#(= main_~main__i~0 0)} is VALID [2022-04-27 16:13:42,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {3351#(= 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] {3351#(= main_~main__i~0 0)} is VALID [2022-04-27 16:13:42,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {3351#(= 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] {3351#(= main_~main__i~0 0)} is VALID [2022-04-27 16:13:42,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {3351#(= 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] {3351#(= main_~main__i~0 0)} is VALID [2022-04-27 16:13:42,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {3351#(= 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] {3352#(<= 1 main_~main__i~0)} is VALID [2022-04-27 16:13:42,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {3352#(<= 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] {3353#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 16:13:42,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#(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[] {3347#false} is VALID [2022-04-27 16:13:42,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {3347#false} [218] L205-->mainErr11ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3347#false} is VALID [2022-04-27 16:13:42,871 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 16:13:42,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:42,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120022105] [2022-04-27 16:13:42,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120022105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:42,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:42,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:13:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054745724] [2022-04-27 16:13:42,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:42,872 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 16:13:42,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:42,872 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 16:13:42,885 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 16:13:42,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:13:42,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:42,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:13:42,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:13:42,885 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 16:13:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:43,161 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-27 16:13:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:13:43,161 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 16:13:43,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:43,161 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 16:13:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-27 16:13:43,162 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 16:13:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-27 16:13:43,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-27 16:13:43,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:43,245 INFO L225 Difference]: With dead ends: 72 [2022-04-27 16:13:43,245 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 16:13:43,245 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 16:13:43,245 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 16:13:43,246 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 16:13:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 16:13:43,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2022-04-27 16:13:43,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:43,247 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 16:13:43,247 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 16:13:43,247 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 16:13:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:43,249 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-27 16:13:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-27 16:13:43,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:43,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:43,249 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 16:13:43,249 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 16:13:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:43,250 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-27 16:13:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-27 16:13:43,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:43,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:43,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:43,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:43,250 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 16:13:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-27 16:13:43,251 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2022-04-27 16:13:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:43,251 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-27 16:13:43,251 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 16:13:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-27 16:13:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 16:13:43,251 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:43,252 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 16:13:43,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 16:13:43,252 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 16:13:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2036575830, now seen corresponding path program 1 times [2022-04-27 16:13:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:43,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977686779] [2022-04-27 16:13:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:43,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {3626#(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] {3617#true} is VALID [2022-04-27 16:13:43,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {3617#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3617#true} is VALID [2022-04-27 16:13:43,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3617#true} {3617#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3617#true} is VALID [2022-04-27 16:13:43,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {3617#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3626#(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 16:13:43,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {3626#(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] {3617#true} is VALID [2022-04-27 16:13:43,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {3617#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3617#true} is VALID [2022-04-27 16:13:43,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3617#true} {3617#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3617#true} is VALID [2022-04-27 16:13:43,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {3617#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3617#true} is VALID [2022-04-27 16:13:43,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {3617#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] {3617#true} is VALID [2022-04-27 16:13:43,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {3617#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] {3622#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {3622#(<= (+ 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] {3622#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {3622#(<= (+ 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[] {3622#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {3622#(<= (+ 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[] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {3623#(<= (+ 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] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {3623#(<= (+ 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] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {3623#(<= (+ 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] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {3623#(<= (+ 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] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {3623#(<= (+ 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] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {3623#(<= (+ 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] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {3623#(<= (+ 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] {3623#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {3623#(<= (+ 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] {3624#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {3624#(<= (+ 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] {3624#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:43,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {3624#(<= (+ 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] {3625#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-27 16:13:43,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {3625#(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[] {3618#false} is VALID [2022-04-27 16:13:43,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {3618#false} [222] L217-->mainErr12ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3618#false} is VALID [2022-04-27 16:13:43,315 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 16:13:43,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:43,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977686779] [2022-04-27 16:13:43,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977686779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:43,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:43,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:13:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550984625] [2022-04-27 16:13:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:43,315 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 16:13:43,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:43,316 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 16:13:43,328 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 16:13:43,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:13:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:43,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:13:43,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:13:43,329 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 16:13:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:43,676 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 16:13:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:13:43,677 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 16:13:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:43,677 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 16:13:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-27 16:13:43,678 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 16:13:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-27 16:13:43,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-27 16:13:43,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:43,755 INFO L225 Difference]: With dead ends: 60 [2022-04-27 16:13:43,755 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 16:13:43,755 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 16:13:43,756 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 16:13:43,756 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 16:13:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 16:13:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-04-27 16:13:43,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:43,757 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 16:13:43,757 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 16:13:43,757 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 16:13:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:43,758 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 16:13:43,758 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 16:13:43,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:43,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:43,759 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 16:13:43,759 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 16:13:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:43,759 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 16:13:43,759 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-27 16:13:43,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:43,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:43,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:43,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:43,760 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 16:13:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-27 16:13:43,761 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2022-04-27 16:13:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:43,761 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-27 16:13:43,761 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 16:13:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-27 16:13:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 16:13:43,761 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:43,761 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 16:13:43,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 16:13:43,761 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 16:13:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1290657461, now seen corresponding path program 1 times [2022-04-27 16:13:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:43,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172781057] [2022-04-27 16:13:43,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:43,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:43,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {3865#(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] {3857#true} is VALID [2022-04-27 16:13:43,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {3857#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3857#true} is VALID [2022-04-27 16:13:43,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3857#true} {3857#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3857#true} is VALID [2022-04-27 16:13:43,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {3857#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3865#(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 16:13:43,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {3865#(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] {3857#true} is VALID [2022-04-27 16:13:43,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {3857#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3857#true} is VALID [2022-04-27 16:13:43,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3857#true} {3857#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3857#true} is VALID [2022-04-27 16:13:43,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {3857#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3857#true} is VALID [2022-04-27 16:13:43,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {3857#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] {3857#true} is VALID [2022-04-27 16:13:43,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {3857#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] {3857#true} is VALID [2022-04-27 16:13:43,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {3857#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] {3862#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:43,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#(= 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[] {3862#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:43,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {3862#(= 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[] {3862#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:43,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {3862#(= 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] {3862#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:43,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {3862#(= 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] {3862#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:43,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {3862#(= 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] {3862#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:43,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {3862#(= 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] {3862#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:43,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(= 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] {3862#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:43,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {3862#(= 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] {3862#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:43,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {3862#(= 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] {3862#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:43,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {3862#(= 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] {3863#(<= 1 main_~main__j~0)} is VALID [2022-04-27 16:13:43,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {3863#(<= 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] {3863#(<= 1 main_~main__j~0)} is VALID [2022-04-27 16:13:43,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {3863#(<= 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] {3863#(<= 1 main_~main__j~0)} is VALID [2022-04-27 16:13:43,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {3863#(<= 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] {3864#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 16:13:43,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {3864#(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[] {3858#false} is VALID [2022-04-27 16:13:43,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {3858#false} [226] L229-->mainErr13ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3858#false} is VALID [2022-04-27 16:13:43,833 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 16:13:43,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:43,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172781057] [2022-04-27 16:13:43,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172781057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:43,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:43,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:13:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866866088] [2022-04-27 16:13:43,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:43,833 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 16:13:43,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:43,833 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 16:13:43,845 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 16:13:43,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:13:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:43,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:13:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:13:43,846 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 16:13:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:44,174 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-27 16:13:44,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:13:44,174 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 16:13:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:44,174 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 16:13:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-04-27 16:13:44,175 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 16:13:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-04-27 16:13:44,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 100 transitions. [2022-04-27 16:13:44,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:44,252 INFO L225 Difference]: With dead ends: 85 [2022-04-27 16:13:44,252 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 16:13:44,253 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 16:13:44,253 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 16:13:44,253 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 16:13:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 16:13:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2022-04-27 16:13:44,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:44,255 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 16:13:44,255 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 16:13:44,255 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 16:13:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:44,256 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-27 16:13:44,256 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-27 16:13:44,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:44,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:44,256 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 16:13:44,256 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 16:13:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:44,257 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-27 16:13:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-04-27 16:13:44,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:44,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:44,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:44,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:44,258 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 16:13:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 16:13:44,258 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2022-04-27 16:13:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:44,258 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 16:13:44,258 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 16:13:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 16:13:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 16:13:44,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:44,259 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 16:13:44,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 16:13:44,259 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 16:13:44,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1355674374, now seen corresponding path program 1 times [2022-04-27 16:13:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:44,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032479358] [2022-04-27 16:13:44,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:44,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:44,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:44,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {4174#(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] {4165#true} is VALID [2022-04-27 16:13:44,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {4165#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4165#true} is VALID [2022-04-27 16:13:44,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4165#true} {4165#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4165#true} is VALID [2022-04-27 16:13:44,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {4165#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4174#(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 16:13:44,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {4174#(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] {4165#true} is VALID [2022-04-27 16:13:44,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {4165#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4165#true} is VALID [2022-04-27 16:13:44,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4165#true} {4165#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4165#true} is VALID [2022-04-27 16:13:44,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {4165#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4165#true} is VALID [2022-04-27 16:13:44,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {4165#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] {4165#true} is VALID [2022-04-27 16:13:44,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {4165#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] {4170#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {4170#(<= (+ 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] {4170#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {4170#(<= (+ 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[] {4170#(<= (+ main_~main__limit~0 4) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {4170#(<= (+ 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[] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {4171#(<= (+ 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] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {4171#(<= (+ 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] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {4171#(<= (+ 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] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {4171#(<= (+ 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] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {4171#(<= (+ 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] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {4171#(<= (+ 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] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {4171#(<= (+ 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] {4171#(<= (+ 5 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {4171#(<= (+ 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] {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {4172#(<= (+ 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] {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {4172#(<= (+ 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] {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {4172#(<= (+ 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] {4172#(<= (+ 4 main_~main__j~0) main_~main__bufsize~0)} is VALID [2022-04-27 16:13:44,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {4172#(<= (+ 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] {4173#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-27 16:13:44,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {4173#(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[] {4166#false} is VALID [2022-04-27 16:13:44,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {4166#false} [230] L245-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4166#false} is VALID [2022-04-27 16:13:44,311 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 16:13:44,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:44,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032479358] [2022-04-27 16:13:44,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032479358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:44,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:44,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:13:44,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655473819] [2022-04-27 16:13:44,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:44,312 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 16:13:44,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:44,312 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 16:13:44,325 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 16:13:44,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:13:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:44,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:13:44,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:13:44,325 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 16:13:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:44,589 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-27 16:13:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:13:44,589 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 16:13:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:44,589 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 16:13:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-27 16:13:44,590 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 16:13:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-27 16:13:44,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-27 16:13:44,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:44,664 INFO L225 Difference]: With dead ends: 58 [2022-04-27 16:13:44,664 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 16:13:44,664 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 16:13:44,665 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 93 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:44,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 63 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:13:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 16:13:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2022-04-27 16:13:44,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:44,666 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 16:13:44,666 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 16:13:44,666 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 16:13:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:44,667 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-27 16:13:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-27 16:13:44,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:44,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:44,667 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 16:13:44,667 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 16:13:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:44,668 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-27 16:13:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-27 16:13:44,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:44,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:44,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:44,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:44,669 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 16:13:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 16:13:44,669 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2022-04-27 16:13:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:44,669 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 16:13:44,669 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 16:13:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 16:13:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 16:13:44,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:13:44,670 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 16:13:44,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 16:13:44,670 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 16:13:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:13:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash 923768623, now seen corresponding path program 1 times [2022-04-27 16:13:44,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:13:44,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616814190] [2022-04-27 16:13:44,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:13:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:13:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:13:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:13:44,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {4404#(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] {4395#true} is VALID [2022-04-27 16:13:44,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {4395#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#true} is VALID [2022-04-27 16:13:44,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4395#true} {4395#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#true} is VALID [2022-04-27 16:13:44,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {4395#true} [152] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4404#(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 16:13:44,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {4404#(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] {4395#true} is VALID [2022-04-27 16:13:44,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {4395#true} [157] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#true} is VALID [2022-04-27 16:13:44,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} [236] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#true} is VALID [2022-04-27 16:13:44,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {4395#true} [153] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#true} is VALID [2022-04-27 16:13:44,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {4395#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] {4395#true} is VALID [2022-04-27 16:13:44,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {4395#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] {4395#true} is VALID [2022-04-27 16:13:44,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {4395#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] {4400#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:44,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {4400#(= 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[] {4400#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:44,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {4400#(= 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[] {4400#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:44,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {4400#(= 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] {4400#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:44,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {4400#(= 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] {4400#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:44,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {4400#(= 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] {4400#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:44,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {4400#(= 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] {4400#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:44,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {4400#(= 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] {4400#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:44,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {4400#(= 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] {4400#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:44,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {4400#(= 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] {4400#(= main_~main__j~0 0)} is VALID [2022-04-27 16:13:44,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {4400#(= 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] {4401#(<= 1 main_~main__j~0)} is VALID [2022-04-27 16:13:44,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {4401#(<= 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] {4401#(<= 1 main_~main__j~0)} is VALID [2022-04-27 16:13:44,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {4401#(<= 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] {4401#(<= 1 main_~main__j~0)} is VALID [2022-04-27 16:13:44,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {4401#(<= 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] {4401#(<= 1 main_~main__j~0)} is VALID [2022-04-27 16:13:44,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {4401#(<= 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] {4402#(<= 2 main_~main__j~0)} is VALID [2022-04-27 16:13:44,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {4402#(<= 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] {4403#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-27 16:13:44,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {4403#(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[] {4396#false} is VALID [2022-04-27 16:13:44,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {4396#false} [234] L257-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4396#false} is VALID [2022-04-27 16:13:44,724 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 16:13:44,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:13:44,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616814190] [2022-04-27 16:13:44,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616814190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:13:44,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:13:44,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:13:44,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940091551] [2022-04-27 16:13:44,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:13:44,725 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 16:13:44,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:13:44,725 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 16:13:44,739 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 16:13:44,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:13:44,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:13:44,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:13:44,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:13:44,740 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 16:13:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:45,199 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2022-04-27 16:13:45,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:13:45,199 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 16:13:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:13:45,199 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 16:13:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2022-04-27 16:13:45,200 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 16:13:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2022-04-27 16:13:45,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 146 transitions. [2022-04-27 16:13:45,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:13:45,325 INFO L225 Difference]: With dead ends: 123 [2022-04-27 16:13:45,325 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:13:45,325 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 16:13:45,326 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 162 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:13:45,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 74 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:13:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:13:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:13:45,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:13:45,327 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 16:13:45,327 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 16:13:45,327 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 16:13:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:45,327 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:13:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:13:45,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:45,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:45,327 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 16:13:45,327 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 16:13:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:13:45,327 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:13:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:13:45,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:45,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:13:45,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:13:45,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:13:45,327 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 16:13:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:13:45,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-04-27 16:13:45,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:13:45,328 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:13:45,328 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 16:13:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:13:45,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:13:45,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-27 16:13:45,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-27 16:13:45,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-27 16:13:45,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-27 16:13:45,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-27 16:13:45,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-27 16:13:45,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-27 16:13:45,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-27 16:13:45,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-27 16:13:45,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-27 16:13:45,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-27 16:13:45,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-27 16:13:45,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-27 16:13:45,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-27 16:13:45,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-27 16:13:45,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-27 16:13:45,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 16:13:45,335 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:13:45,336 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:13:45,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:13:45 BasicIcfg [2022-04-27 16:13:45,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:13:45,338 INFO L158 Benchmark]: Toolchain (without parser) took 7550.78ms. Allocated memory was 173.0MB in the beginning and 262.1MB in the end (delta: 89.1MB). Free memory was 124.0MB in the beginning and 227.0MB in the end (delta: -103.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:13:45,338 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:13:45,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.11ms. Allocated memory is still 173.0MB. Free memory was 123.8MB in the beginning and 142.4MB in the end (delta: -18.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 16:13:45,339 INFO L158 Benchmark]: Boogie Preprocessor took 22.48ms. Allocated memory is still 173.0MB. Free memory was 142.4MB in the beginning and 140.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:13:45,339 INFO L158 Benchmark]: RCFGBuilder took 329.24ms. Allocated memory is still 173.0MB. Free memory was 140.4MB in the beginning and 124.5MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-27 16:13:45,339 INFO L158 Benchmark]: IcfgTransformer took 73.68ms. Allocated memory is still 173.0MB. Free memory was 124.5MB in the beginning and 121.9MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 16:13:45,339 INFO L158 Benchmark]: TraceAbstraction took 6810.30ms. Allocated memory was 173.0MB in the beginning and 262.1MB in the end (delta: 89.1MB). Free memory was 121.4MB in the beginning and 227.0MB in the end (delta: -105.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:13:45,340 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.11ms. Allocated memory is still 173.0MB. Free memory was 123.8MB in the beginning and 142.4MB in the end (delta: -18.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.48ms. Allocated memory is still 173.0MB. Free memory was 142.4MB in the beginning and 140.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 329.24ms. Allocated memory is still 173.0MB. Free memory was 140.4MB in the beginning and 124.5MB in the end (delta: 15.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 73.68ms. Allocated memory is still 173.0MB. Free memory was 124.5MB in the beginning and 121.9MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6810.30ms. Allocated memory was 173.0MB in the beginning and 262.1MB in the end (delta: 89.1MB). Free memory was 121.4MB in the beginning and 227.0MB in the end (delta: -105.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 59]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 141]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 153]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 112]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 165]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 193]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 205]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 217]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 229]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 245]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1971 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1971 mSDsluCounter, 1183 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 236 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1590 IncrementalHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 947 mSDtfsCounter, 1590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:13:45,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...