/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_3-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:20:05,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:20:05,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:20:05,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:20:05,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:20:05,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:20:05,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:20:05,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:20:05,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:20:05,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:20:05,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:20:05,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:20:05,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:20:05,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:20:05,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:20:05,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:20:05,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:20:05,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:20:05,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:20:05,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:20:05,141 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:20:05,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:20:05,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:20:05,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:20:05,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:20:05,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:20:05,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:20:05,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:20:05,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:20:05,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:20:05,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:20:05,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:20:05,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:20:05,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:20:05,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:20:05,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:20:05,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:20:05,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:20:05,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:20:05,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:20:05,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:20:05,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:20:05,164 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:20:05,192 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:20:05,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:20:05,194 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:20:05,194 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:20:05,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:20:05,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:20:05,195 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:20:05,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:20:05,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:20:05,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:20:05,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:20:05,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:20:05,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:20:05,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:20:05,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:20:05,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:20:05,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:20:05,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:20:05,197 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:20:05,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:20:05,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:20:05,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:20:05,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:20:05,198 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:20:05,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:20:05,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:20:05,198 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:20:05,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:20:05,199 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:20:05,200 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:20:05,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:20:05,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:20:05,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:20:05,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:20:05,430 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:20:05,431 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-1.i [2022-04-27 21:20:05,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac0239fe/0cb28c20ce8944fc917e1abf3f764015/FLAG007c694b8 [2022-04-27 21:20:05,880 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:20:05,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-1.i [2022-04-27 21:20:05,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac0239fe/0cb28c20ce8944fc917e1abf3f764015/FLAG007c694b8 [2022-04-27 21:20:05,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac0239fe/0cb28c20ce8944fc917e1abf3f764015 [2022-04-27 21:20:05,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:20:05,914 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:20:05,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:20:05,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:20:05,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:20:05,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:20:05" (1/1) ... [2022-04-27 21:20:05,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60b3118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:05, skipping insertion in model container [2022-04-27 21:20:05,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:20:05" (1/1) ... [2022-04-27 21:20:05,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:20:05,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:20:06,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-acceleration/array_3-1.i[849,862] [2022-04-27 21:20:06,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:20:06,100 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:20:06,110 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-acceleration/array_3-1.i[849,862] [2022-04-27 21:20:06,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:20:06,133 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:20:06,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:06 WrapperNode [2022-04-27 21:20:06,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:20:06,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:20:06,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:20:06,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:20:06,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:06" (1/1) ... [2022-04-27 21:20:06,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:06" (1/1) ... [2022-04-27 21:20:06,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:06" (1/1) ... [2022-04-27 21:20:06,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:06" (1/1) ... [2022-04-27 21:20:06,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:06" (1/1) ... [2022-04-27 21:20:06,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:06" (1/1) ... [2022-04-27 21:20:06,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:06" (1/1) ... [2022-04-27 21:20:06,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:20:06,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:20:06,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:20:06,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:20:06,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:06" (1/1) ... [2022-04-27 21:20:06,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:20:06,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:20:06,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:20:06,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:20:06,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:20:06,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:20:06,244 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:20:06,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:20:06,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:20:06,246 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:20:06,246 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:20:06,246 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:20:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:20:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:20:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:20:06,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:20:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:20:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:20:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 21:20:06,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:20:06,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:20:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:20:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:20:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:20:06,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:20:06,301 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:20:06,302 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:20:06,412 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:20:06,418 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:20:06,418 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 21:20:06,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:20:06 BoogieIcfgContainer [2022-04-27 21:20:06,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:20:06,421 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:20:06,421 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:20:06,422 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:20:06,424 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:20:06" (1/1) ... [2022-04-27 21:20:06,426 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:20:06,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:20:06 BasicIcfg [2022-04-27 21:20:06,448 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:20:06,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:20:06,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:20:06,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:20:06,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:20:05" (1/4) ... [2022-04-27 21:20:06,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2f7ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:20:06, skipping insertion in model container [2022-04-27 21:20:06,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:20:06" (2/4) ... [2022-04-27 21:20:06,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2f7ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:20:06, skipping insertion in model container [2022-04-27 21:20:06,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:20:06" (3/4) ... [2022-04-27 21:20:06,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2f7ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:20:06, skipping insertion in model container [2022-04-27 21:20:06,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:20:06" (4/4) ... [2022-04-27 21:20:06,455 INFO L111 eAbstractionObserver]: Analyzing ICFG array_3-1.iqvasr [2022-04-27 21:20:06,468 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:20:06,469 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:20:06,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:20:06,511 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74b39d79, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3020a1c9 [2022-04-27 21:20:06,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:20:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:20:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:20:06,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:06,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:06,525 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:06,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:06,530 INFO L85 PathProgramCache]: Analyzing trace with hash 261736565, now seen corresponding path program 1 times [2022-04-27 21:20:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:06,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099415055] [2022-04-27 21:20:06,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:06,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:06,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {28#true} is VALID [2022-04-27 21:20:06,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 21:20:06,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 21:20:06,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:06,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {28#true} is VALID [2022-04-27 21:20:06,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 21:20:06,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 21:20:06,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 21:20:06,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} [70] mainENTRY-->L24-3: Formula: (and (= 0 |v_main_~#A~0.offset_1|) (= v_main_~i~0_5 0) (= (store |v_#length_2| |v_main_~#A~0.base_1| 4096) |v_#length_1|) (= (select |v_#valid_2| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_5, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {28#true} is VALID [2022-04-27 21:20:06,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} [72] L24-3-->L24-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 21:20:06,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} [75] L24-4-->L28-4: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {29#false} is VALID [2022-04-27 21:20:06,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} [78] L28-4-->L28-5: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 21:20:06,718 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#false} [81] L28-5-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~i~0_14 1024) 1 0)) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {29#false} is VALID [2022-04-27 21:20:06,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} [85] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29#false} is VALID [2022-04-27 21:20:06,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 21:20:06,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 21:20:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:20:06,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:06,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099415055] [2022-04-27 21:20:06,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099415055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:20:06,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:20:06,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:20:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140738223] [2022-04-27 21:20:06,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:20:06,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:20:06,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:06,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:06,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:06,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:20:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:06,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:20:06,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:20:06,776 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:06,845 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 21:20:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:20:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:20:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-27 21:20:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-27 21:20:06,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-27 21:20:06,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:06,923 INFO L225 Difference]: With dead ends: 42 [2022-04-27 21:20:06,923 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 21:20:06,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:20:06,929 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:06,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:20:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 21:20:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 21:20:06,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:06,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:06,956 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:06,956 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:06,969 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 21:20:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 21:20:06,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:06,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:06,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 21:20:06,970 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 21:20:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:06,976 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 21:20:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 21:20:06,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:06,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:06,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:06,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 21:20:06,982 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2022-04-27 21:20:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:06,982 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 21:20:06,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 21:20:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:20:06,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:06,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:06,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:20:06,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1236111046, now seen corresponding path program 1 times [2022-04-27 21:20:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:06,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44652299] [2022-04-27 21:20:06,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:07,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:07,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {151#true} is VALID [2022-04-27 21:20:07,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#true} is VALID [2022-04-27 21:20:07,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#true} is VALID [2022-04-27 21:20:07,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {151#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:07,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {151#true} is VALID [2022-04-27 21:20:07,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#true} is VALID [2022-04-27 21:20:07,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151#true} {151#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#true} is VALID [2022-04-27 21:20:07,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {151#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#true} is VALID [2022-04-27 21:20:07,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#true} [70] mainENTRY-->L24-3: Formula: (and (= 0 |v_main_~#A~0.offset_1|) (= v_main_~i~0_5 0) (= (store |v_#length_2| |v_main_~#A~0.base_1| 4096) |v_#length_1|) (= (select |v_#valid_2| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_5, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {156#(= main_~i~0 0)} is VALID [2022-04-27 21:20:07,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#(= main_~i~0 0)} [73] L24-3-->L24-4: Formula: (not (< v_main_~i~0_8 1024)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {152#false} is VALID [2022-04-27 21:20:07,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#false} [75] L24-4-->L28-4: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {152#false} is VALID [2022-04-27 21:20:07,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#false} [77] L28-4-->L28-1: Formula: (= |v_main_#t~mem4_1| (select (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_13 4) |v_main_~#A~0.offset_5|))) InVars {main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4] {152#false} is VALID [2022-04-27 21:20:07,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#false} [79] L28-1-->L28-5: Formula: (= |v_main_#t~mem4_3| 0) InVars {main_#t~mem4=|v_main_#t~mem4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {152#false} is VALID [2022-04-27 21:20:07,070 INFO L272 TraceCheckUtils]: 10: Hoare triple {152#false} [81] L28-5-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~i~0_14 1024) 1 0)) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {152#false} is VALID [2022-04-27 21:20:07,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#false} [85] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {152#false} is VALID [2022-04-27 21:20:07,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#false} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {152#false} is VALID [2022-04-27 21:20:07,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#false} is VALID [2022-04-27 21:20:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:20:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:07,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44652299] [2022-04-27 21:20:07,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44652299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:20:07,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:20:07,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:20:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619402822] [2022-04-27 21:20:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:20:07,073 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:20:07,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:07,074 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:07,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:07,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:20:07,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:07,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:20:07,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:20:07,088 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:07,189 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 21:20:07,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:20:07,190 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 21:20:07,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:07,190 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-27 21:20:07,192 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-27 21:20:07,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-27 21:20:07,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:07,244 INFO L225 Difference]: With dead ends: 35 [2022-04-27 21:20:07,245 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 21:20:07,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:20:07,250 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:07,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:20:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 21:20:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-27 21:20:07,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:07,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:07,263 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:07,264 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:07,266 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 21:20:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 21:20:07,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:07,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:07,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-27 21:20:07,267 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-27 21:20:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:07,270 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 21:20:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 21:20:07,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:07,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:07,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:07,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-27 21:20:07,278 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-27 21:20:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:07,279 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-27 21:20:07,280 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-27 21:20:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:20:07,281 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:07,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:07,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:20:07,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:07,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1563816184, now seen corresponding path program 1 times [2022-04-27 21:20:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:07,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030983249] [2022-04-27 21:20:07,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:07,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {293#true} is VALID [2022-04-27 21:20:07,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {293#true} {293#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {293#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:07,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {293#true} is VALID [2022-04-27 21:20:07,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} [70] mainENTRY-->L24-3: Formula: (and (= 0 |v_main_~#A~0.offset_1|) (= v_main_~i~0_5 0) (= (store |v_#length_2| |v_main_~#A~0.base_1| 4096) |v_#length_1|) (= (select |v_#valid_2| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_5, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {298#(= main_~i~0 0)} is VALID [2022-04-27 21:20:07,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(= main_~i~0 0)} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {298#(= main_~i~0 0)} is VALID [2022-04-27 21:20:07,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {298#(= main_~i~0 0)} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {299#(<= main_~i~0 1)} is VALID [2022-04-27 21:20:07,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(<= main_~i~0 1)} [73] L24-3-->L24-4: Formula: (not (< v_main_~i~0_8 1024)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {294#false} is VALID [2022-04-27 21:20:07,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#false} [75] L24-4-->L28-4: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {294#false} is VALID [2022-04-27 21:20:07,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#false} [77] L28-4-->L28-1: Formula: (= |v_main_#t~mem4_1| (select (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_13 4) |v_main_~#A~0.offset_5|))) InVars {main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4] {294#false} is VALID [2022-04-27 21:20:07,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#false} [79] L28-1-->L28-5: Formula: (= |v_main_#t~mem4_3| 0) InVars {main_#t~mem4=|v_main_#t~mem4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {294#false} is VALID [2022-04-27 21:20:07,415 INFO L272 TraceCheckUtils]: 12: Hoare triple {294#false} [81] L28-5-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~i~0_14 1024) 1 0)) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {294#false} is VALID [2022-04-27 21:20:07,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#false} [85] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {294#false} is VALID [2022-04-27 21:20:07,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#false} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {294#false} is VALID [2022-04-27 21:20:07,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#false} is VALID [2022-04-27 21:20:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:20:07,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:07,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030983249] [2022-04-27 21:20:07,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030983249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:20:07,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734119942] [2022-04-27 21:20:07,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:07,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:20:07,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:20:07,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:20:07,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:20:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:07,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 21:20:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:07,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:20:07,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {293#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {293#true} is VALID [2022-04-27 21:20:07,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} [70] mainENTRY-->L24-3: Formula: (and (= 0 |v_main_~#A~0.offset_1|) (= v_main_~i~0_5 0) (= (store |v_#length_2| |v_main_~#A~0.base_1| 4096) |v_#length_1|) (= (select |v_#valid_2| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_5, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {319#(<= main_~i~0 0)} is VALID [2022-04-27 21:20:07,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {319#(<= main_~i~0 0)} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {319#(<= main_~i~0 0)} is VALID [2022-04-27 21:20:07,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {319#(<= main_~i~0 0)} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {299#(<= main_~i~0 1)} is VALID [2022-04-27 21:20:07,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(<= main_~i~0 1)} [73] L24-3-->L24-4: Formula: (not (< v_main_~i~0_8 1024)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {294#false} is VALID [2022-04-27 21:20:07,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#false} [75] L24-4-->L28-4: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {294#false} is VALID [2022-04-27 21:20:07,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#false} [77] L28-4-->L28-1: Formula: (= |v_main_#t~mem4_1| (select (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_13 4) |v_main_~#A~0.offset_5|))) InVars {main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4] {294#false} is VALID [2022-04-27 21:20:07,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#false} [79] L28-1-->L28-5: Formula: (= |v_main_#t~mem4_3| 0) InVars {main_#t~mem4=|v_main_#t~mem4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {294#false} is VALID [2022-04-27 21:20:07,669 INFO L272 TraceCheckUtils]: 12: Hoare triple {294#false} [81] L28-5-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~i~0_14 1024) 1 0)) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {294#false} is VALID [2022-04-27 21:20:07,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#false} [85] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {294#false} is VALID [2022-04-27 21:20:07,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#false} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {294#false} is VALID [2022-04-27 21:20:07,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#false} is VALID [2022-04-27 21:20:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:20:07,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:20:07,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#false} is VALID [2022-04-27 21:20:07,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#false} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {294#false} is VALID [2022-04-27 21:20:07,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#false} [85] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {294#false} is VALID [2022-04-27 21:20:07,794 INFO L272 TraceCheckUtils]: 12: Hoare triple {294#false} [81] L28-5-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~i~0_14 1024) 1 0)) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {294#false} is VALID [2022-04-27 21:20:07,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#false} [79] L28-1-->L28-5: Formula: (= |v_main_#t~mem4_3| 0) InVars {main_#t~mem4=|v_main_#t~mem4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {294#false} is VALID [2022-04-27 21:20:07,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#false} [77] L28-4-->L28-1: Formula: (= |v_main_#t~mem4_1| (select (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_13 4) |v_main_~#A~0.offset_5|))) InVars {main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4] {294#false} is VALID [2022-04-27 21:20:07,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#false} [75] L24-4-->L28-4: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {294#false} is VALID [2022-04-27 21:20:07,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#(< main_~i~0 1024)} [73] L24-3-->L24-4: Formula: (not (< v_main_~i~0_8 1024)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {294#false} is VALID [2022-04-27 21:20:07,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {375#(< main_~i~0 1023)} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {371#(< main_~i~0 1024)} is VALID [2022-04-27 21:20:07,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(< main_~i~0 1023)} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {375#(< main_~i~0 1023)} is VALID [2022-04-27 21:20:07,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} [70] mainENTRY-->L24-3: Formula: (and (= 0 |v_main_~#A~0.offset_1|) (= v_main_~i~0_5 0) (= (store |v_#length_2| |v_main_~#A~0.base_1| 4096) |v_#length_1|) (= (select |v_#valid_2| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_5, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {375#(< main_~i~0 1023)} is VALID [2022-04-27 21:20:07,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {293#true} is VALID [2022-04-27 21:20:07,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {293#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-04-27 21:20:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:20:07,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734119942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:20:07,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:20:07,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 21:20:07,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833507265] [2022-04-27 21:20:07,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:20:07,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:20:07,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:07,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:07,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:07,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:20:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:07,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:20:07,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:20:07,838 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:08,065 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-27 21:20:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:20:08,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:20:08,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 21:20:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 21:20:08,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-27 21:20:08,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:08,139 INFO L225 Difference]: With dead ends: 52 [2022-04-27 21:20:08,139 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 21:20:08,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:20:08,142 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:08,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 31 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:20:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 21:20:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-04-27 21:20:08,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:08,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,160 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,161 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:08,162 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 21:20:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-27 21:20:08,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:08,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:08,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-27 21:20:08,164 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-27 21:20:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:08,166 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 21:20:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-27 21:20:08,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:08,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:08,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:08,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-27 21:20:08,169 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2022-04-27 21:20:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:08,169 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-27 21:20:08,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 21:20:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:20:08,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:08,170 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:08,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:20:08,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:20:08,392 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:08,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:08,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1985862862, now seen corresponding path program 2 times [2022-04-27 21:20:08,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:08,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97876410] [2022-04-27 21:20:08,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:08,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:08,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:08,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {610#true} is VALID [2022-04-27 21:20:08,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {610#true} is VALID [2022-04-27 21:20:08,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {610#true} is VALID [2022-04-27 21:20:08,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:08,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {610#true} is VALID [2022-04-27 21:20:08,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {610#true} is VALID [2022-04-27 21:20:08,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {610#true} is VALID [2022-04-27 21:20:08,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {610#true} is VALID [2022-04-27 21:20:08,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} [70] mainENTRY-->L24-3: Formula: (and (= 0 |v_main_~#A~0.offset_1|) (= v_main_~i~0_5 0) (= (store |v_#length_2| |v_main_~#A~0.base_1| 4096) |v_#length_1|) (= (select |v_#valid_2| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_5, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {610#true} is VALID [2022-04-27 21:20:08,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#true} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {610#true} is VALID [2022-04-27 21:20:08,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#true} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {610#true} is VALID [2022-04-27 21:20:08,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {610#true} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {610#true} is VALID [2022-04-27 21:20:08,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#true} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {610#true} is VALID [2022-04-27 21:20:08,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {610#true} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {610#true} is VALID [2022-04-27 21:20:08,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {610#true} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {610#true} is VALID [2022-04-27 21:20:08,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#true} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {610#true} is VALID [2022-04-27 21:20:08,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {610#true} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {610#true} is VALID [2022-04-27 21:20:08,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {610#true} [73] L24-3-->L24-4: Formula: (not (< v_main_~i~0_8 1024)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {610#true} is VALID [2022-04-27 21:20:08,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#true} [75] L24-4-->L28-4: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {615#(<= main_~i~0 1024)} is VALID [2022-04-27 21:20:08,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {615#(<= main_~i~0 1024)} [77] L28-4-->L28-1: Formula: (= |v_main_#t~mem4_1| (select (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_13 4) |v_main_~#A~0.offset_5|))) InVars {main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4] {615#(<= main_~i~0 1024)} is VALID [2022-04-27 21:20:08,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {615#(<= main_~i~0 1024)} [79] L28-1-->L28-5: Formula: (= |v_main_#t~mem4_3| 0) InVars {main_#t~mem4=|v_main_#t~mem4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {615#(<= main_~i~0 1024)} is VALID [2022-04-27 21:20:08,523 INFO L272 TraceCheckUtils]: 18: Hoare triple {615#(<= main_~i~0 1024)} [81] L28-5-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~i~0_14 1024) 1 0)) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {616#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:20:08,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {616#(not (= |__VERIFIER_assert_#in~cond| 0))} [85] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {617#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:20:08,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(not (= __VERIFIER_assert_~cond 0))} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {611#false} is VALID [2022-04-27 21:20:08,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {611#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {611#false} is VALID [2022-04-27 21:20:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 21:20:08,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:08,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97876410] [2022-04-27 21:20:08,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97876410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:20:08,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:20:08,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:20:08,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416495061] [2022-04-27 21:20:08,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:20:08,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:20:08,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:08,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:08,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:20:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:08,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:20:08,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:20:08,543 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:08,687 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-27 21:20:08,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:20:08,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:20:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-27 21:20:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-27 21:20:08,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-04-27 21:20:08,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:08,725 INFO L225 Difference]: With dead ends: 41 [2022-04-27 21:20:08,726 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 21:20:08,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:20:08,727 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:08,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:20:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 21:20:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 21:20:08,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:08,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,741 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,741 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:08,743 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-27 21:20:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-27 21:20:08,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:08,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:08,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-27 21:20:08,744 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-27 21:20:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:08,745 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-27 21:20:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-27 21:20:08,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:08,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:08,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:08,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-27 21:20:08,747 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2022-04-27 21:20:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:08,747 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-27 21:20:08,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-27 21:20:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 21:20:08,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:20:08,748 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:20:08,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 21:20:08,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:20:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:20:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1390832492, now seen corresponding path program 1 times [2022-04-27 21:20:08,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:20:08,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138722182] [2022-04-27 21:20:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:20:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:20:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:08,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {809#true} is VALID [2022-04-27 21:20:08,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:08,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {809#true} {809#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:08,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {809#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:20:08,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {809#true} is VALID [2022-04-27 21:20:08,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:08,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:08,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {809#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:08,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {809#true} [70] mainENTRY-->L24-3: Formula: (and (= 0 |v_main_~#A~0.offset_1|) (= v_main_~i~0_5 0) (= (store |v_#length_2| |v_main_~#A~0.base_1| 4096) |v_#length_1|) (= (select |v_#valid_2| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_5, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {809#true} is VALID [2022-04-27 21:20:08,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {809#true} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {809#true} is VALID [2022-04-27 21:20:08,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {809#true} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {809#true} is VALID [2022-04-27 21:20:08,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {809#true} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {809#true} is VALID [2022-04-27 21:20:08,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {809#true} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {809#true} is VALID [2022-04-27 21:20:08,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {809#true} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {809#true} is VALID [2022-04-27 21:20:08,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {809#true} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {809#true} is VALID [2022-04-27 21:20:08,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {809#true} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {809#true} is VALID [2022-04-27 21:20:08,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {809#true} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {809#true} is VALID [2022-04-27 21:20:08,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {809#true} [73] L24-3-->L24-4: Formula: (not (< v_main_~i~0_8 1024)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:08,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {809#true} [75] L24-4-->L28-4: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {814#(= main_~i~0 0)} is VALID [2022-04-27 21:20:08,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {814#(= main_~i~0 0)} [77] L28-4-->L28-1: Formula: (= |v_main_#t~mem4_1| (select (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_13 4) |v_main_~#A~0.offset_5|))) InVars {main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4] {814#(= main_~i~0 0)} is VALID [2022-04-27 21:20:08,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {814#(= main_~i~0 0)} [80] L28-1-->L29: Formula: (not (= |v_main_#t~mem4_5| 0)) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {814#(= main_~i~0 0)} is VALID [2022-04-27 21:20:08,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(= main_~i~0 0)} [83] L29-->L28-3: Formula: (not (<= 1023 v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {814#(= main_~i~0 0)} is VALID [2022-04-27 21:20:08,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {814#(= main_~i~0 0)} [86] L28-3-->L28-4: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {815#(<= main_~i~0 1)} is VALID [2022-04-27 21:20:08,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {815#(<= main_~i~0 1)} [77] L28-4-->L28-1: Formula: (= |v_main_#t~mem4_1| (select (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_13 4) |v_main_~#A~0.offset_5|))) InVars {main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4] {815#(<= main_~i~0 1)} is VALID [2022-04-27 21:20:08,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {815#(<= main_~i~0 1)} [79] L28-1-->L28-5: Formula: (= |v_main_#t~mem4_3| 0) InVars {main_#t~mem4=|v_main_#t~mem4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {815#(<= main_~i~0 1)} is VALID [2022-04-27 21:20:08,847 INFO L272 TraceCheckUtils]: 22: Hoare triple {815#(<= main_~i~0 1)} [81] L28-5-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~i~0_14 1024) 1 0)) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {816#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:20:08,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {816#(not (= |__VERIFIER_assert_#in~cond| 0))} [85] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {817#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:20:08,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {817#(not (= __VERIFIER_assert_~cond 0))} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {810#false} is VALID [2022-04-27 21:20:08,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {810#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {810#false} is VALID [2022-04-27 21:20:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 21:20:08,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:20:08,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138722182] [2022-04-27 21:20:08,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138722182] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:20:08,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795479754] [2022-04-27 21:20:08,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:20:08,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:20:08,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:20:08,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:20:08,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 21:20:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:08,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 21:20:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:20:08,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:20:09,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {809#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:09,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {809#true} is VALID [2022-04-27 21:20:09,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:09,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:09,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {809#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:09,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {809#true} [70] mainENTRY-->L24-3: Formula: (and (= 0 |v_main_~#A~0.offset_1|) (= v_main_~i~0_5 0) (= (store |v_#length_2| |v_main_~#A~0.base_1| 4096) |v_#length_1|) (= (select |v_#valid_2| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_5, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {837#(<= main_~i~0 0)} is VALID [2022-04-27 21:20:09,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {837#(<= main_~i~0 0)} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {837#(<= main_~i~0 0)} is VALID [2022-04-27 21:20:09,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {837#(<= main_~i~0 0)} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {815#(<= main_~i~0 1)} is VALID [2022-04-27 21:20:09,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {815#(<= main_~i~0 1)} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {815#(<= main_~i~0 1)} is VALID [2022-04-27 21:20:09,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {815#(<= main_~i~0 1)} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {850#(<= main_~i~0 2)} is VALID [2022-04-27 21:20:09,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {850#(<= main_~i~0 2)} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {850#(<= main_~i~0 2)} is VALID [2022-04-27 21:20:09,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {850#(<= main_~i~0 2)} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {857#(<= main_~i~0 3)} is VALID [2022-04-27 21:20:09,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {857#(<= main_~i~0 3)} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {857#(<= main_~i~0 3)} is VALID [2022-04-27 21:20:09,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {857#(<= main_~i~0 3)} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {864#(<= main_~i~0 4)} is VALID [2022-04-27 21:20:09,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {864#(<= main_~i~0 4)} [73] L24-3-->L24-4: Formula: (not (< v_main_~i~0_8 1024)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {810#false} is VALID [2022-04-27 21:20:09,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {810#false} [75] L24-4-->L28-4: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {810#false} is VALID [2022-04-27 21:20:09,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {810#false} [77] L28-4-->L28-1: Formula: (= |v_main_#t~mem4_1| (select (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_13 4) |v_main_~#A~0.offset_5|))) InVars {main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4] {810#false} is VALID [2022-04-27 21:20:09,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#false} [80] L28-1-->L29: Formula: (not (= |v_main_#t~mem4_5| 0)) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {810#false} is VALID [2022-04-27 21:20:09,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {810#false} [83] L29-->L28-3: Formula: (not (<= 1023 v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {810#false} is VALID [2022-04-27 21:20:09,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {810#false} [86] L28-3-->L28-4: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {810#false} is VALID [2022-04-27 21:20:09,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {810#false} [77] L28-4-->L28-1: Formula: (= |v_main_#t~mem4_1| (select (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_13 4) |v_main_~#A~0.offset_5|))) InVars {main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4] {810#false} is VALID [2022-04-27 21:20:09,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {810#false} [79] L28-1-->L28-5: Formula: (= |v_main_#t~mem4_3| 0) InVars {main_#t~mem4=|v_main_#t~mem4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {810#false} is VALID [2022-04-27 21:20:09,088 INFO L272 TraceCheckUtils]: 22: Hoare triple {810#false} [81] L28-5-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~i~0_14 1024) 1 0)) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {810#false} is VALID [2022-04-27 21:20:09,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {810#false} [85] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {810#false} is VALID [2022-04-27 21:20:09,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {810#false} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {810#false} is VALID [2022-04-27 21:20:09,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {810#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {810#false} is VALID [2022-04-27 21:20:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:20:09,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:20:09,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {810#false} [90] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {810#false} is VALID [2022-04-27 21:20:09,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {810#false} [88] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {810#false} is VALID [2022-04-27 21:20:09,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {810#false} [85] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {810#false} is VALID [2022-04-27 21:20:09,266 INFO L272 TraceCheckUtils]: 22: Hoare triple {810#false} [81] L28-5-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~i~0_14 1024) 1 0)) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {810#false} is VALID [2022-04-27 21:20:09,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {810#false} [79] L28-1-->L28-5: Formula: (= |v_main_#t~mem4_3| 0) InVars {main_#t~mem4=|v_main_#t~mem4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {810#false} is VALID [2022-04-27 21:20:09,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {810#false} [77] L28-4-->L28-1: Formula: (= |v_main_#t~mem4_1| (select (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_13 4) |v_main_~#A~0.offset_5|))) InVars {main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4] {810#false} is VALID [2022-04-27 21:20:09,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {810#false} [86] L28-3-->L28-4: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post3] {810#false} is VALID [2022-04-27 21:20:09,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {810#false} [83] L29-->L28-3: Formula: (not (<= 1023 v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {810#false} is VALID [2022-04-27 21:20:09,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#false} [80] L28-1-->L29: Formula: (not (= |v_main_#t~mem4_5| 0)) InVars {main_#t~mem4=|v_main_#t~mem4_5|} OutVars{} AuxVars[] AssignedVars[main_#t~mem4] {810#false} is VALID [2022-04-27 21:20:09,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {810#false} [77] L28-4-->L28-1: Formula: (= |v_main_#t~mem4_1| (select (select |v_#memory_int_3| |v_main_~#A~0.base_5|) (+ (* v_main_~i~0_13 4) |v_main_~#A~0.offset_5|))) InVars {main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} OutVars{main_~i~0=v_main_~i~0_13, #memory_int=|v_#memory_int_3|, main_#t~mem4=|v_main_#t~mem4_1|, main_~#A~0.offset=|v_main_~#A~0.offset_5|, main_~#A~0.base=|v_main_~#A~0.base_5|} AuxVars[] AssignedVars[main_#t~mem4] {810#false} is VALID [2022-04-27 21:20:09,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {810#false} [75] L24-4-->L28-4: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {810#false} is VALID [2022-04-27 21:20:09,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {934#(< main_~i~0 1024)} [73] L24-3-->L24-4: Formula: (not (< v_main_~i~0_8 1024)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {810#false} is VALID [2022-04-27 21:20:09,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {938#(< main_~i~0 1023)} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {934#(< main_~i~0 1024)} is VALID [2022-04-27 21:20:09,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#(< main_~i~0 1023)} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {938#(< main_~i~0 1023)} is VALID [2022-04-27 21:20:09,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {945#(< main_~i~0 1022)} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {938#(< main_~i~0 1023)} is VALID [2022-04-27 21:20:09,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {945#(< main_~i~0 1022)} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {945#(< main_~i~0 1022)} is VALID [2022-04-27 21:20:09,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {952#(< main_~i~0 1021)} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {945#(< main_~i~0 1022)} is VALID [2022-04-27 21:20:09,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {952#(< main_~i~0 1021)} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {952#(< main_~i~0 1021)} is VALID [2022-04-27 21:20:09,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#(< main_~i~0 1020)} [76] L24-2-->L24-3: Formula: (= v_main_~i~0_10 (+ v_main_~i~0_11 1)) InVars {main_~i~0=v_main_~i~0_11} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {952#(< main_~i~0 1021)} is VALID [2022-04-27 21:20:09,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {959#(< main_~i~0 1020)} [74] L24-3-->L24-2: Formula: (and (< v_main_~i~0_9 1024) (= (store |v_#memory_int_2| |v_main_~#A~0.base_4| (store (select |v_#memory_int_2| |v_main_~#A~0.base_4|) (+ (* v_main_~i~0_9 4) |v_main_~#A~0.offset_4|) |v_main_#t~nondet2_2|)) |v_#memory_int_1|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {#memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_9, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#A~0.base=|v_main_~#A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {959#(< main_~i~0 1020)} is VALID [2022-04-27 21:20:09,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {809#true} [70] mainENTRY-->L24-3: Formula: (and (= 0 |v_main_~#A~0.offset_1|) (= v_main_~i~0_5 0) (= (store |v_#length_2| |v_main_~#A~0.base_1| 4096) |v_#length_1|) (= (select |v_#valid_2| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#A~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_5, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|} AuxVars[] AssignedVars[main_~#A~0.offset, #valid, main_~i~0, #length, main_~#A~0.base] {959#(< main_~i~0 1020)} is VALID [2022-04-27 21:20:09,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {809#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:09,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} [93] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:09,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:09,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#true} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_4| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 1) 0) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 48 (select .cse0 0)) (= 12 (select |v_#length_3| 2)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_4|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {809#true} is VALID [2022-04-27 21:20:09,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {809#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#true} is VALID [2022-04-27 21:20:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:20:09,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795479754] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:20:09,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:20:09,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-04-27 21:20:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300158491] [2022-04-27 21:20:09,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:20:09,274 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 21:20:09,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:20:09,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:09,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:09,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 21:20:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:20:09,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 21:20:09,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-04-27 21:20:09,319 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:09,869 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2022-04-27 21:20:09,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 21:20:09,869 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 21:20:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:20:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 112 transitions. [2022-04-27 21:20:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 112 transitions. [2022-04-27 21:20:09,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 112 transitions. [2022-04-27 21:20:09,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:20:09,977 INFO L225 Difference]: With dead ends: 99 [2022-04-27 21:20:09,977 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:20:09,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2022-04-27 21:20:09,978 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:20:09,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 38 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:20:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:20:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:20:09,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:20:09,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:20:09,980 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:20:09,980 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:20:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:09,980 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:20:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:20:09,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:09,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:09,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:20:09,980 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:20:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:20:09,980 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:20:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:20:09,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:09,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:20:09,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:20:09,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:20:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:20:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:20:09,981 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-27 21:20:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:20:09,981 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:20:09,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:20:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:20:09,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:20:09,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:20:10,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:20:10,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:20:10,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:20:10,343 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:20:10,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:20:10,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:20:10,344 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:20:10,344 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:20:10,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:20:10,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:20:10,344 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 34) the Hoare annotation is: true [2022-04-27 21:20:10,344 INFO L902 garLoopResultBuilder]: At program point L24-3(lines 24 26) the Hoare annotation is: true [2022-04-27 21:20:10,344 INFO L899 garLoopResultBuilder]: For program point L24-4(lines 24 26) no Hoare annotation was computed. [2022-04-27 21:20:10,344 INFO L899 garLoopResultBuilder]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2022-04-27 21:20:10,344 INFO L895 garLoopResultBuilder]: At program point L28-4(lines 28 32) the Hoare annotation is: (< main_~i~0 1024) [2022-04-27 21:20:10,344 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 28 32) no Hoare annotation was computed. [2022-04-27 21:20:10,344 INFO L895 garLoopResultBuilder]: At program point L28-5(lines 28 32) the Hoare annotation is: (< main_~i~0 1024) [2022-04-27 21:20:10,344 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2022-04-27 21:20:10,344 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-27 21:20:10,344 INFO L899 garLoopResultBuilder]: For program point L28-3(lines 28 32) no Hoare annotation was computed. [2022-04-27 21:20:10,345 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 34) no Hoare annotation was computed. [2022-04-27 21:20:10,345 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 34) no Hoare annotation was computed. [2022-04-27 21:20:10,345 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-27 21:20:10,345 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 21:20:10,345 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 21:20:10,345 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-04-27 21:20:10,345 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 21:20:10,345 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-04-27 21:20:10,348 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-27 21:20:10,350 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 21:20:10,355 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 21:20:10,356 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:20:10,356 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 21:20:10,356 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 21:20:10,356 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 21:20:10,356 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 21:20:10,356 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 21:20:10,356 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:20:10,356 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2022-04-27 21:20:10,357 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:20:10,357 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:20:10,357 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:20:10,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:20:10 BasicIcfg [2022-04-27 21:20:10,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:20:10,366 INFO L158 Benchmark]: Toolchain (without parser) took 4454.80ms. Allocated memory was 181.4MB in the beginning and 228.6MB in the end (delta: 47.2MB). Free memory was 154.7MB in the beginning and 147.1MB in the end (delta: 7.6MB). Peak memory consumption was 55.0MB. Max. memory is 8.0GB. [2022-04-27 21:20:10,366 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 181.4MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:20:10,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.46ms. Allocated memory was 181.4MB in the beginning and 228.6MB in the end (delta: 47.2MB). Free memory was 154.5MB in the beginning and 198.7MB in the end (delta: -44.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-27 21:20:10,366 INFO L158 Benchmark]: Boogie Preprocessor took 43.28ms. Allocated memory is still 228.6MB. Free memory was 198.7MB in the beginning and 197.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:20:10,367 INFO L158 Benchmark]: RCFGBuilder took 240.26ms. Allocated memory is still 228.6MB. Free memory was 197.2MB in the beginning and 186.1MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 21:20:10,367 INFO L158 Benchmark]: IcfgTransformer took 27.31ms. Allocated memory is still 228.6MB. Free memory was 186.1MB in the beginning and 184.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:20:10,367 INFO L158 Benchmark]: TraceAbstraction took 3915.02ms. Allocated memory is still 228.6MB. Free memory was 183.5MB in the beginning and 147.1MB in the end (delta: 36.4MB). Peak memory consumption was 37.3MB. Max. memory is 8.0GB. [2022-04-27 21:20:10,368 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.13ms. Allocated memory is still 181.4MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.46ms. Allocated memory was 181.4MB in the beginning and 228.6MB in the end (delta: 47.2MB). Free memory was 154.5MB in the beginning and 198.7MB in the end (delta: -44.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.28ms. Allocated memory is still 228.6MB. Free memory was 198.7MB in the beginning and 197.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 240.26ms. Allocated memory is still 228.6MB. Free memory was 197.2MB in the beginning and 186.1MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 27.31ms. Allocated memory is still 228.6MB. Free memory was 186.1MB in the beginning and 184.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3915.02ms. Allocated memory is still 228.6MB. Free memory was 183.5MB in the beginning and 147.1MB in the end (delta: 36.4MB). Peak memory consumption was 37.3MB. 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: 16]: 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 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 221 IncrementalHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 80 mSDtfsCounter, 221 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=3, InterpolantAutomatonStates: 35, 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, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 21 PreInvPairs, 51 NumberOfFragments, 18 HoareAnnotationTreeSize, 21 FomulaSimplifications, 33 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 196 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 189 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 36/73 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 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: i < 1024 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 21:20:10,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...