/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/openssl-simplified/s3_srvr_1b.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:00:10,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:00:10,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:00:10,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:00:10,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:00:10,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:00:10,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:00:10,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:00:10,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:00:10,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:00:10,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:00:10,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:00:10,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:00:10,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:00:10,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:00:10,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:00:10,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:00:10,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:00:10,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:00:10,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:00:10,390 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:00:10,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:00:10,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:00:10,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:00:10,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:00:10,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:00:10,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:00:10,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:00:10,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:00:10,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:00:10,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:00:10,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:00:10,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:00:10,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:00:10,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:00:10,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:00:10,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:00:10,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:00:10,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:00:10,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:00:10,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:00:10,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:00:10,404 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 02:00:10,424 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:00:10,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:00:10,425 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 02:00:10,425 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 02:00:10,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 02:00:10,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 02:00:10,426 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 02:00:10,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:00:10,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:00:10,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:00:10,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:00:10,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:00:10,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:00:10,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:00:10,427 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:00:10,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:00:10,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:00:10,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:00:10,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:00:10,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:00:10,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:00:10,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 02:00:10,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 02:00:10,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 02:00:10,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 02:00:10,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:00:10,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 02:00:10,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 02:00:10,429 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 02:00:10,429 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-28 02:00:10,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:00:10,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:00:10,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:00:10,655 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:00:10,656 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:00:10,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c [2022-04-28 02:00:10,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e72b2420/e4e658cb26cc4ff29c4ffa8e8b9808b7/FLAGe925559a4 [2022-04-28 02:00:11,139 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:00:11,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c [2022-04-28 02:00:11,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e72b2420/e4e658cb26cc4ff29c4ffa8e8b9808b7/FLAGe925559a4 [2022-04-28 02:00:11,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e72b2420/e4e658cb26cc4ff29c4ffa8e8b9808b7 [2022-04-28 02:00:11,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:00:11,162 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 02:00:11,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:00:11,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:00:11,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:00:11,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:00:11" (1/1) ... [2022-04-28 02:00:11,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e577fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:00:11, skipping insertion in model container [2022-04-28 02:00:11,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:00:11" (1/1) ... [2022-04-28 02:00:11,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:00:11,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:00:11,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c[8244,8257] [2022-04-28 02:00:11,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:00:11,355 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:00:11,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c[8244,8257] [2022-04-28 02:00:11,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:00:11,385 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:00:11,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:00:11 WrapperNode [2022-04-28 02:00:11,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:00:11,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:00:11,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:00:11,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:00:11,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:00:11" (1/1) ... [2022-04-28 02:00:11,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:00:11" (1/1) ... [2022-04-28 02:00:11,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:00:11" (1/1) ... [2022-04-28 02:00:11,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:00:11" (1/1) ... [2022-04-28 02:00:11,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:00:11" (1/1) ... [2022-04-28 02:00:11,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:00:11" (1/1) ... [2022-04-28 02:00:11,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:00:11" (1/1) ... [2022-04-28 02:00:11,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:00:11,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:00:11,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:00:11,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:00:11,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:00:11" (1/1) ... [2022-04-28 02:00:11,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:00:11,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:00:11,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:00:11,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:00:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:00:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:00:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:00:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:00:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:00:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:00:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:00:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:00:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 02:00:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:00:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 02:00:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:00:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:00:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:00:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:00:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:00:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:00:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:00:11,544 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:00:11,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:00:11,654 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:00:11,668 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:00:11,669 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:00:11,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:00:11 BoogieIcfgContainer [2022-04-28 02:00:11,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:00:11,671 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 02:00:11,671 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 02:00:11,673 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 02:00:11,675 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:00:11" (1/1) ... [2022-04-28 02:00:11,676 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 02:00:11,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 02:00:11 BasicIcfg [2022-04-28 02:00:11,718 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 02:00:11,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:00:11,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:00:11,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:00:11,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:00:11" (1/4) ... [2022-04-28 02:00:11,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7fe4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:00:11, skipping insertion in model container [2022-04-28 02:00:11,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:00:11" (2/4) ... [2022-04-28 02:00:11,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7fe4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:00:11, skipping insertion in model container [2022-04-28 02:00:11,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:00:11" (3/4) ... [2022-04-28 02:00:11,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7fe4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:00:11, skipping insertion in model container [2022-04-28 02:00:11,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 02:00:11" (4/4) ... [2022-04-28 02:00:11,732 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b.cil.cqvasr [2022-04-28 02:00:11,748 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:00:11,748 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:00:11,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:00:11,801 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@7dcc2561, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6cded839 [2022-04-28 02:00:11,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:00:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:00:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 02:00:11,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:00:11,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:00:11,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:00:11,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:00:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash 472059503, now seen corresponding path program 1 times [2022-04-28 02:00:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:00:11,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279442670] [2022-04-28 02:00:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:00:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:00:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:00:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:12,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-28 02:00:12,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-28 02:00:12,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-28 02:00:12,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:00:12,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-28 02:00:12,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-28 02:00:12,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-28 02:00:12,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-28 02:00:12,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {37#(= main_~blastFlag~0 0)} is VALID [2022-04-28 02:00:12,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(= main_~blastFlag~0 0)} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#(= main_~blastFlag~0 0)} is VALID [2022-04-28 02:00:12,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#(= main_~blastFlag~0 0)} [121] L30-->L108: Formula: (and (< 2 v_main_~blastFlag~0_6) (<= v_main_~s__state~0_5 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 02:00:12,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-28 02:00:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:00:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:00:12,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279442670] [2022-04-28 02:00:12,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279442670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:00:12,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:00:12,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:00:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815817915] [2022-04-28 02:00:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:00:12,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 02:00:12,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:00:12,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:12,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:00:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:00:12,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:00:12,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:00:12,106 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:12,366 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-04-28 02:00:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:00:12,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 02:00:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:00:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 02:00:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 02:00:12,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-28 02:00:12,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:12,515 INFO L225 Difference]: With dead ends: 70 [2022-04-28 02:00:12,515 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 02:00:12,518 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-28 02:00:12,521 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 79 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:00:12,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 44 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:00:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 02:00:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 02:00:12,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:00:12,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,549 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,550 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:12,553 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-28 02:00:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-28 02:00:12,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:12,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:12,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 02:00:12,555 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 02:00:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:12,559 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-28 02:00:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-28 02:00:12,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:12,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:12,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:00:12,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:00:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-28 02:00:12,564 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 9 [2022-04-28 02:00:12,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:00:12,564 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-04-28 02:00:12,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-28 02:00:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:00:12,565 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:00:12,565 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:00:12,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:00:12,566 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:00:12,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:00:12,566 INFO L85 PathProgramCache]: Analyzing trace with hash -493282618, now seen corresponding path program 1 times [2022-04-28 02:00:12,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:00:12,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236333944] [2022-04-28 02:00:12,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:00:12,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:00:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:12,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:00:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:12,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {269#true} is VALID [2022-04-28 02:00:12,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#true} is VALID [2022-04-28 02:00:12,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#true} is VALID [2022-04-28 02:00:12,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:00:12,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {269#true} is VALID [2022-04-28 02:00:12,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#true} is VALID [2022-04-28 02:00:12,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#true} is VALID [2022-04-28 02:00:12,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#true} is VALID [2022-04-28 02:00:12,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {269#true} is VALID [2022-04-28 02:00:12,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {269#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#true} is VALID [2022-04-28 02:00:12,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {269#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {269#true} is VALID [2022-04-28 02:00:12,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {269#true} [126] L36-->L37: Formula: (= v_main_~s__state~0_7 8466) InVars {main_~s__state~0=v_main_~s__state~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_7} AuxVars[] AssignedVars[] {269#true} is VALID [2022-04-28 02:00:12,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#true} [128] L37-->L69-1: Formula: (and (= 2 v_main_~blastFlag~0_13) (= v_main_~blastFlag~0_14 0)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[main_~blastFlag~0] {269#true} is VALID [2022-04-28 02:00:12,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {269#true} [132] L69-1-->L111: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_16 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_16, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {274#(<= 8656 main_~s__state~0)} is VALID [2022-04-28 02:00:12,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#(<= 8656 main_~s__state~0)} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#(<= 8656 main_~s__state~0)} is VALID [2022-04-28 02:00:12,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#(<= 8656 main_~s__state~0)} [121] L30-->L108: Formula: (and (< 2 v_main_~blastFlag~0_6) (<= v_main_~s__state~0_5 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} AuxVars[] AssignedVars[] {270#false} is VALID [2022-04-28 02:00:12,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {270#false} is VALID [2022-04-28 02:00:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:00:12,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:00:12,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236333944] [2022-04-28 02:00:12,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236333944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:00:12,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:00:12,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:00:12,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422248536] [2022-04-28 02:00:12,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:00:12,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:00:12,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:00:12,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:12,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:00:12,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:00:12,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:00:12,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:00:12,643 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:12,782 INFO L93 Difference]: Finished difference Result 86 states and 120 transitions. [2022-04-28 02:00:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:00:12,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:00:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:00:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-04-28 02:00:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-04-28 02:00:12,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2022-04-28 02:00:12,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:12,855 INFO L225 Difference]: With dead ends: 86 [2022-04-28 02:00:12,855 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 02:00:12,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:00:12,857 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:00:12,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 43 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:00:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 02:00:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2022-04-28 02:00:12,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:00:12,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,867 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,868 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:12,870 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-04-28 02:00:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-04-28 02:00:12,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:12,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:12,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 02:00:12,872 INFO L87 Difference]: Start difference. First operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 02:00:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:12,874 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-04-28 02:00:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-04-28 02:00:12,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:12,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:12,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:00:12,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:00:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-28 02:00:12,879 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 14 [2022-04-28 02:00:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:00:12,879 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-04-28 02:00:12,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-04-28 02:00:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:00:12,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:00:12,880 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:00:12,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:00:12,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:00:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:00:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash -493252827, now seen corresponding path program 1 times [2022-04-28 02:00:12,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:00:12,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186457325] [2022-04-28 02:00:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:00:12,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:00:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:12,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:00:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:12,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {568#true} is VALID [2022-04-28 02:00:12,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:00:12,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {568#true} {568#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:00:12,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:00:12,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {568#true} is VALID [2022-04-28 02:00:12,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {568#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:00:12,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {568#true} {568#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:00:12,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {568#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:00:12,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {568#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {568#true} is VALID [2022-04-28 02:00:12,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {568#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:00:12,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {568#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:00:12,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {568#true} [126] L36-->L37: Formula: (= v_main_~s__state~0_7 8466) InVars {main_~s__state~0=v_main_~s__state~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_7} AuxVars[] AssignedVars[] {568#true} is VALID [2022-04-28 02:00:12,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {568#true} [128] L37-->L69-1: Formula: (and (= 2 v_main_~blastFlag~0_13) (= v_main_~blastFlag~0_14 0)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[main_~blastFlag~0] {573#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-28 02:00:12,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(= (+ (- 2) main_~blastFlag~0) 0)} [133] L69-1-->L111: Formula: (and (= v_main_~s__state~0_17 8512) (= v_main_~s__hit~0_7 0)) InVars {main_~s__hit~0=v_main_~s__hit~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_17, main_~s__hit~0=v_main_~s__hit~0_7} AuxVars[] AssignedVars[main_~s__state~0] {573#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-28 02:00:12,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {573#(= (+ (- 2) main_~blastFlag~0) 0)} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {573#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-28 02:00:12,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {573#(= (+ (- 2) main_~blastFlag~0) 0)} [121] L30-->L108: Formula: (and (< 2 v_main_~blastFlag~0_6) (<= v_main_~s__state~0_5 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} AuxVars[] AssignedVars[] {569#false} is VALID [2022-04-28 02:00:12,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#false} is VALID [2022-04-28 02:00:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:00:12,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:00:12,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186457325] [2022-04-28 02:00:12,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186457325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:00:12,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:00:12,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:00:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721655406] [2022-04-28 02:00:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:00:12,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:00:12,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:00:12,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:12,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:12,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:00:12,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:00:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:00:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:00:12,971 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:13,104 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2022-04-28 02:00:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:00:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 02:00:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:00:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-28 02:00:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-28 02:00:13,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2022-04-28 02:00:13,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:13,189 INFO L225 Difference]: With dead ends: 90 [2022-04-28 02:00:13,189 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 02:00:13,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:00:13,197 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:00:13,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:00:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 02:00:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 02:00:13,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:00:13,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,211 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,212 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:13,214 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-04-28 02:00:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-28 02:00:13,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:13,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:13,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 02:00:13,216 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 02:00:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:13,219 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-04-28 02:00:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-28 02:00:13,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:13,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:13,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:00:13,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:00:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-28 02:00:13,222 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 14 [2022-04-28 02:00:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:00:13,222 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-28 02:00:13,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-28 02:00:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:00:13,223 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:00:13,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:00:13,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:00:13,224 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:00:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:00:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1278160632, now seen corresponding path program 1 times [2022-04-28 02:00:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:00:13,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422355982] [2022-04-28 02:00:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:00:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:00:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:13,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:00:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:13,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {924#true} is VALID [2022-04-28 02:00:13,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {924#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {924#true} {924#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {924#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:00:13,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {924#true} is VALID [2022-04-28 02:00:13,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {924#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {924#true} {924#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {924#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {924#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {924#true} is VALID [2022-04-28 02:00:13,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {924#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {924#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {924#true} [126] L36-->L37: Formula: (= v_main_~s__state~0_7 8466) InVars {main_~s__state~0=v_main_~s__state~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_7} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {924#true} [128] L37-->L69-1: Formula: (and (= 2 v_main_~blastFlag~0_13) (= v_main_~blastFlag~0_14 0)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[main_~blastFlag~0] {924#true} is VALID [2022-04-28 02:00:13,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {924#true} [132] L69-1-->L111: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_16 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_16, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {924#true} is VALID [2022-04-28 02:00:13,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {924#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {924#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {924#true} [127] L36-->L41: Formula: (not (= v_main_~s__state~0_8 8466)) InVars {main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {924#true} [131] L41-->L57: Formula: (not (= v_main_~s__state~0_10 8512)) InVars {main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {924#true} [136] L57-->L61: Formula: (not (= v_main_~s__state~0_13 8640)) InVars {main_~s__state~0=v_main_~s__state~0_13} OutVars{main_~s__state~0=v_main_~s__state~0_13} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {924#true} [141] L61-->L62: Formula: (= v_main_~s__state~0_14 8656) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {924#true} is VALID [2022-04-28 02:00:13,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {924#true} [145] L62-->L100-1: Formula: (and (= v_main_~blastFlag~0_4 2) (= v_main_~blastFlag~0_3 3)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_3} AuxVars[] AssignedVars[main_~blastFlag~0] {929#(= 3 main_~blastFlag~0)} is VALID [2022-04-28 02:00:13,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#(= 3 main_~blastFlag~0)} [148] L100-1-->L107: Formula: (not (= v_main_~blastFlag~0_10 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_10} AuxVars[] AssignedVars[] {929#(= 3 main_~blastFlag~0)} is VALID [2022-04-28 02:00:13,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#(= 3 main_~blastFlag~0)} [151] L107-->L108: Formula: (= 5 v_main_~blastFlag~0_11) InVars {main_~blastFlag~0=v_main_~blastFlag~0_11} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_11} AuxVars[] AssignedVars[] {925#false} is VALID [2022-04-28 02:00:13,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {925#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {925#false} is VALID [2022-04-28 02:00:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 02:00:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:00:13,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422355982] [2022-04-28 02:00:13,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422355982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:00:13,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:00:13,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:00:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249932730] [2022-04-28 02:00:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:00:13,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:00:13,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:00:13,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:13,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:00:13,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:00:13,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:00:13,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:00:13,330 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:13,448 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2022-04-28 02:00:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:00:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 02:00:13,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:00:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-04-28 02:00:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-04-28 02:00:13,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2022-04-28 02:00:13,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:13,533 INFO L225 Difference]: With dead ends: 130 [2022-04-28 02:00:13,533 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 02:00:13,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:00:13,539 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:00:13,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 53 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:00:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 02:00:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-28 02:00:13,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:00:13,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,570 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,571 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:13,574 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-04-28 02:00:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2022-04-28 02:00:13,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:13,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:13,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-28 02:00:13,579 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-28 02:00:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:13,586 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-04-28 02:00:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2022-04-28 02:00:13,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:13,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:13,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:00:13,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:00:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 83 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-04-28 02:00:13,592 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 21 [2022-04-28 02:00:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:00:13,592 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-04-28 02:00:13,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-04-28 02:00:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 02:00:13,594 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:00:13,594 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:00:13,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 02:00:13,594 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:00:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:00:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1498444954, now seen corresponding path program 1 times [2022-04-28 02:00:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:00:13,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232536751] [2022-04-28 02:00:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:00:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:00:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:13,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:00:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:13,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {1409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1403#true} is VALID [2022-04-28 02:00:13,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {1403#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1403#true} {1403#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {1403#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:00:13,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {1409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1403#true} is VALID [2022-04-28 02:00:13,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {1403#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1403#true} {1403#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {1403#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1403#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {1403#true} is VALID [2022-04-28 02:00:13,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1403#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {1403#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {1403#true} [126] L36-->L37: Formula: (= v_main_~s__state~0_7 8466) InVars {main_~s__state~0=v_main_~s__state~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_7} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {1403#true} [128] L37-->L69-1: Formula: (and (= 2 v_main_~blastFlag~0_13) (= v_main_~blastFlag~0_14 0)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[main_~blastFlag~0] {1403#true} is VALID [2022-04-28 02:00:13,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {1403#true} [132] L69-1-->L111: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_16 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_16, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {1403#true} is VALID [2022-04-28 02:00:13,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {1403#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {1403#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {1403#true} [127] L36-->L41: Formula: (not (= v_main_~s__state~0_8 8466)) InVars {main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {1403#true} [131] L41-->L57: Formula: (not (= v_main_~s__state~0_10 8512)) InVars {main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {1403#true} [136] L57-->L61: Formula: (not (= v_main_~s__state~0_13 8640)) InVars {main_~s__state~0=v_main_~s__state~0_13} OutVars{main_~s__state~0=v_main_~s__state~0_13} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {1403#true} [141] L61-->L62: Formula: (= v_main_~s__state~0_14 8656) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {1403#true} [145] L62-->L100-1: Formula: (and (= v_main_~blastFlag~0_4 2) (= v_main_~blastFlag~0_3 3)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_3} AuxVars[] AssignedVars[main_~blastFlag~0] {1403#true} is VALID [2022-04-28 02:00:13,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {1403#true} [148] L100-1-->L107: Formula: (not (= v_main_~blastFlag~0_10 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_10} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {1403#true} [152] L107-->L104-1: Formula: (not (= 5 v_main_~blastFlag~0_12)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_12} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_12} AuxVars[] AssignedVars[] {1403#true} is VALID [2022-04-28 02:00:13,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {1403#true} [149] L104-1-->L111: Formula: (and (= v_main_~s__state~0_11 8640) (not (= v_main_~s__hit~0_4 0))) InVars {main_~s__hit~0=v_main_~s__hit~0_4} OutVars{main_~s__state~0=v_main_~s__state~0_11, main_~s__hit~0=v_main_~s__hit~0_4} AuxVars[] AssignedVars[main_~s__state~0] {1408#(<= 8640 main_~s__state~0)} is VALID [2022-04-28 02:00:13,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {1408#(<= 8640 main_~s__state~0)} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1408#(<= 8640 main_~s__state~0)} is VALID [2022-04-28 02:00:13,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {1408#(<= 8640 main_~s__state~0)} [121] L30-->L108: Formula: (and (< 2 v_main_~blastFlag~0_6) (<= v_main_~s__state~0_5 8512)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_6, main_~s__state~0=v_main_~s__state~0_5} AuxVars[] AssignedVars[] {1404#false} is VALID [2022-04-28 02:00:13,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {1404#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1404#false} is VALID [2022-04-28 02:00:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 02:00:13,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:00:13,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232536751] [2022-04-28 02:00:13,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232536751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:00:13,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:00:13,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:00:13,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625890093] [2022-04-28 02:00:13,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:00:13,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:00:13,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:00:13,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:13,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:00:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:00:13,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:00:13,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:00:13,713 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:13,825 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2022-04-28 02:00:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:00:13,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 02:00:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:00:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-28 02:00:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-28 02:00:13,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-28 02:00:13,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:13,897 INFO L225 Difference]: With dead ends: 167 [2022-04-28 02:00:13,897 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 02:00:13,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:00:13,899 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:00:13,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 41 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:00:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 02:00:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-04-28 02:00:13,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:00:13,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,921 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,921 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:13,923 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 02:00:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 02:00:13,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:13,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:13,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 02:00:13,924 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 02:00:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:13,926 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-28 02:00:13,926 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-28 02:00:13,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:13,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:13,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:00:13,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:00:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-04-28 02:00:13,929 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 24 [2022-04-28 02:00:13,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:00:13,929 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-04-28 02:00:13,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 02:00:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 02:00:13,930 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:00:13,931 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:00:13,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 02:00:13,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:00:13,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:00:13,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1101537560, now seen corresponding path program 1 times [2022-04-28 02:00:13,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:00:13,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885634611] [2022-04-28 02:00:13,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:00:13,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:00:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:13,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:00:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:00:14,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {1860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1854#true} is VALID [2022-04-28 02:00:14,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {1854#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1854#true} is VALID [2022-04-28 02:00:14,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1854#true} {1854#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1854#true} is VALID [2022-04-28 02:00:14,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {1854#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:00:14,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {1860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 17) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1854#true} is VALID [2022-04-28 02:00:14,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {1854#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1854#true} is VALID [2022-04-28 02:00:14,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1854#true} {1854#true} [153] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1854#true} is VALID [2022-04-28 02:00:14,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {1854#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1854#true} is VALID [2022-04-28 02:00:14,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {1854#true} [115] mainENTRY-->L111: Formula: (and (= v_main_~s__state~0_1 8466) (= |v_main_#t~nondet4_2| v_main_~s__hit~0_1) (= v_main_~blastFlag~0_1 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~tmp___1~0=v_main_~tmp___1~0_1, main_~s__state~0=v_main_~s__state~0_1, main_~s__hit~0=v_main_~s__hit~0_1, main_~blastFlag~0=v_main_~blastFlag~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~tmp___1~0, main_~blastFlag~0, main_~s__state~0, main_~s__hit~0] {1854#true} is VALID [2022-04-28 02:00:14,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {1854#true} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1854#true} is VALID [2022-04-28 02:00:14,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {1854#true} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1854#true} is VALID [2022-04-28 02:00:14,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {1854#true} [126] L36-->L37: Formula: (= v_main_~s__state~0_7 8466) InVars {main_~s__state~0=v_main_~s__state~0_7} OutVars{main_~s__state~0=v_main_~s__state~0_7} AuxVars[] AssignedVars[] {1854#true} is VALID [2022-04-28 02:00:14,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {1854#true} [128] L37-->L69-1: Formula: (and (= 2 v_main_~blastFlag~0_13) (= v_main_~blastFlag~0_14 0)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_14} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_13} AuxVars[] AssignedVars[main_~blastFlag~0] {1854#true} is VALID [2022-04-28 02:00:14,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {1854#true} [132] L69-1-->L111: Formula: (and (not (= v_main_~s__hit~0_6 0)) (= v_main_~s__state~0_16 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_6} OutVars{main_~s__state~0=v_main_~s__state~0_16, main_~s__hit~0=v_main_~s__hit~0_6} AuxVars[] AssignedVars[main_~s__state~0] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {1859#(not (= main_~s__hit~0 0))} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {1859#(not (= main_~s__hit~0 0))} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {1859#(not (= main_~s__hit~0 0))} [127] L36-->L41: Formula: (not (= v_main_~s__state~0_8 8466)) InVars {main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {1859#(not (= main_~s__hit~0 0))} [131] L41-->L57: Formula: (not (= v_main_~s__state~0_10 8512)) InVars {main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {1859#(not (= main_~s__hit~0 0))} [136] L57-->L61: Formula: (not (= v_main_~s__state~0_13 8640)) InVars {main_~s__state~0=v_main_~s__state~0_13} OutVars{main_~s__state~0=v_main_~s__state~0_13} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {1859#(not (= main_~s__hit~0 0))} [141] L61-->L62: Formula: (= v_main_~s__state~0_14 8656) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {1859#(not (= main_~s__hit~0 0))} [145] L62-->L100-1: Formula: (and (= v_main_~blastFlag~0_4 2) (= v_main_~blastFlag~0_3 3)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_4} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_3} AuxVars[] AssignedVars[main_~blastFlag~0] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {1859#(not (= main_~s__hit~0 0))} [148] L100-1-->L107: Formula: (not (= v_main_~blastFlag~0_10 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_10} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {1859#(not (= main_~s__hit~0 0))} [152] L107-->L104-1: Formula: (not (= 5 v_main_~blastFlag~0_12)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_12} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_12} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {1859#(not (= main_~s__hit~0 0))} [149] L104-1-->L111: Formula: (and (= v_main_~s__state~0_11 8640) (not (= v_main_~s__hit~0_4 0))) InVars {main_~s__hit~0=v_main_~s__hit~0_4} OutVars{main_~s__state~0=v_main_~s__state~0_11, main_~s__hit~0=v_main_~s__hit~0_4} AuxVars[] AssignedVars[main_~s__state~0] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {1859#(not (= main_~s__hit~0 0))} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {1859#(not (= main_~s__hit~0 0))} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {1859#(not (= main_~s__hit~0 0))} [127] L36-->L41: Formula: (not (= v_main_~s__state~0_8 8466)) InVars {main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {1859#(not (= main_~s__hit~0 0))} [131] L41-->L57: Formula: (not (= v_main_~s__state~0_10 8512)) InVars {main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {1859#(not (= main_~s__hit~0 0))} [135] L57-->L58: Formula: (= v_main_~s__state~0_12 8640) InVars {main_~s__state~0=v_main_~s__state~0_12} OutVars{main_~s__state~0=v_main_~s__state~0_12} AuxVars[] AssignedVars[] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {1859#(not (= main_~s__hit~0 0))} [139] L58-->L89-1: Formula: (and (= 3 v_main_~blastFlag~0_17) (= v_main_~blastFlag~0_16 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_17} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_16} AuxVars[] AssignedVars[main_~blastFlag~0] {1859#(not (= main_~s__hit~0 0))} is VALID [2022-04-28 02:00:14,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {1859#(not (= main_~s__hit~0 0))} [144] L89-1-->L111: Formula: (and (= v_main_~s__hit~0_3 0) (= v_main_~s__state~0_4 8656)) InVars {main_~s__hit~0=v_main_~s__hit~0_3} OutVars{main_~s__state~0=v_main_~s__state~0_4, main_~s__hit~0=v_main_~s__hit~0_3} AuxVars[] AssignedVars[main_~s__state~0] {1855#false} is VALID [2022-04-28 02:00:14,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {1855#false} [119] L111-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1855#false} is VALID [2022-04-28 02:00:14,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {1855#false} [122] L30-->L36: Formula: (or (not (< 2 v_main_~blastFlag~0_9)) (not (<= v_main_~s__state~0_6 8512))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_9, main_~s__state~0=v_main_~s__state~0_6} AuxVars[] AssignedVars[] {1855#false} is VALID [2022-04-28 02:00:14,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {1855#false} [127] L36-->L41: Formula: (not (= v_main_~s__state~0_8 8466)) InVars {main_~s__state~0=v_main_~s__state~0_8} OutVars{main_~s__state~0=v_main_~s__state~0_8} AuxVars[] AssignedVars[] {1855#false} is VALID [2022-04-28 02:00:14,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {1855#false} [131] L41-->L57: Formula: (not (= v_main_~s__state~0_10 8512)) InVars {main_~s__state~0=v_main_~s__state~0_10} OutVars{main_~s__state~0=v_main_~s__state~0_10} AuxVars[] AssignedVars[] {1855#false} is VALID [2022-04-28 02:00:14,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {1855#false} [136] L57-->L61: Formula: (not (= v_main_~s__state~0_13 8640)) InVars {main_~s__state~0=v_main_~s__state~0_13} OutVars{main_~s__state~0=v_main_~s__state~0_13} AuxVars[] AssignedVars[] {1855#false} is VALID [2022-04-28 02:00:14,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {1855#false} [141] L61-->L62: Formula: (= v_main_~s__state~0_14 8656) InVars {main_~s__state~0=v_main_~s__state~0_14} OutVars{main_~s__state~0=v_main_~s__state~0_14} AuxVars[] AssignedVars[] {1855#false} is VALID [2022-04-28 02:00:14,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {1855#false} [146] L62-->L100-1: Formula: (not (= v_main_~blastFlag~0_5 2)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_5} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_5} AuxVars[] AssignedVars[] {1855#false} is VALID [2022-04-28 02:00:14,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {1855#false} [148] L100-1-->L107: Formula: (not (= v_main_~blastFlag~0_10 4)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_10} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_10} AuxVars[] AssignedVars[] {1855#false} is VALID [2022-04-28 02:00:14,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {1855#false} [151] L107-->L108: Formula: (= 5 v_main_~blastFlag~0_11) InVars {main_~blastFlag~0=v_main_~blastFlag~0_11} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_11} AuxVars[] AssignedVars[] {1855#false} is VALID [2022-04-28 02:00:14,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {1855#false} [124] L108-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1855#false} is VALID [2022-04-28 02:00:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 02:00:14,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:00:14,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885634611] [2022-04-28 02:00:14,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885634611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:00:14,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:00:14,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:00:14,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878597575] [2022-04-28 02:00:14,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:00:14,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 02:00:14,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:00:14,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:14,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:14,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:00:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 02:00:14,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:00:14,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:00:14,038 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:14,115 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2022-04-28 02:00:14,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:00:14,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 02:00:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:00:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-04-28 02:00:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-04-28 02:00:14,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2022-04-28 02:00:14,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:00:14,163 INFO L225 Difference]: With dead ends: 87 [2022-04-28 02:00:14,163 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 02:00:14,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:00:14,164 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:00:14,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:00:14,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 02:00:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 02:00:14,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:00:14,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:00:14,166 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:00:14,166 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:00:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:14,166 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:00:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:00:14,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:14,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:14,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 02:00:14,167 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 02:00:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:00:14,167 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 02:00:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:00:14,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:14,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:00:14,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:00:14,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:00:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 02:00:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 02:00:14,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-28 02:00:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:00:14,168 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 02:00:14,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:00:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 02:00:14,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:00:14,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:00:14,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 02:00:14,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 02:00:14,302 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-28 02:00:14,302 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-28 02:00:14,302 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-28 02:00:14,302 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 02:00:14,302 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 02:00:14,302 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-28 02:00:14,302 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-28 02:00:14,302 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 152) the Hoare annotation is: true [2022-04-28 02:00:14,302 INFO L895 garLoopResultBuilder]: At program point L111(lines 29 146) the Hoare annotation is: (or (= main_~blastFlag~0 0) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (= 2 main_~blastFlag~0)) [2022-04-28 02:00:14,302 INFO L902 garLoopResultBuilder]: At program point L148(lines 20 152) the Hoare annotation is: true [2022-04-28 02:00:14,302 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2022-04-28 02:00:14,303 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 152) no Hoare annotation was computed. [2022-04-28 02:00:14,303 INFO L895 garLoopResultBuilder]: At program point L108(lines 20 152) the Hoare annotation is: false [2022-04-28 02:00:14,303 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 139) no Hoare annotation was computed. [2022-04-28 02:00:14,303 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 152) no Hoare annotation was computed. [2022-04-28 02:00:14,303 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2022-04-28 02:00:14,303 INFO L895 garLoopResultBuilder]: At program point L37(lines 36 139) the Hoare annotation is: (or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-28 02:00:14,303 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 136) no Hoare annotation was computed. [2022-04-28 02:00:14,303 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 65 118) no Hoare annotation was computed. [2022-04-28 02:00:14,303 INFO L895 garLoopResultBuilder]: At program point L42(lines 41 136) the Hoare annotation is: (or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-28 02:00:14,304 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 122) no Hoare annotation was computed. [2022-04-28 02:00:14,304 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 85) no Hoare annotation was computed. [2022-04-28 02:00:14,304 INFO L895 garLoopResultBuilder]: At program point L58(lines 57 122) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) .cse0) (and (= main_~blastFlag~0 0) .cse0) (and (= (+ (- 2) main_~blastFlag~0) 0) .cse0))) [2022-04-28 02:00:14,304 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 120) no Hoare annotation was computed. [2022-04-28 02:00:14,304 INFO L899 garLoopResultBuilder]: For program point L89-1(lines 65 118) no Hoare annotation was computed. [2022-04-28 02:00:14,304 INFO L895 garLoopResultBuilder]: At program point L62(lines 61 120) the Hoare annotation is: (let ((.cse0 (<= 8656 main_~s__state~0))) (or (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) .cse0) (and (= main_~blastFlag~0 0) .cse0) (and (= 2 main_~blastFlag~0) .cse0))) [2022-04-28 02:00:14,304 INFO L899 garLoopResultBuilder]: For program point L100-1(lines 65 118) no Hoare annotation was computed. [2022-04-28 02:00:14,304 INFO L899 garLoopResultBuilder]: For program point L104-1(lines 65 118) no Hoare annotation was computed. [2022-04-28 02:00:14,304 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 109) no Hoare annotation was computed. [2022-04-28 02:00:14,306 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-28 02:00:14,308 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:00:14,311 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:00:14,312 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:00:14,312 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 02:00:14,312 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 02:00:14,312 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:00:14,312 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 02:00:14,312 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 02:00:14,312 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:00:14,312 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-28 02:00:14,312 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:00:14,312 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-28 02:00:14,313 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-04-28 02:00:14,314 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-04-28 02:00:14,314 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-28 02:00:14,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:00:14 BasicIcfg [2022-04-28 02:00:14,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:00:14,327 INFO L158 Benchmark]: Toolchain (without parser) took 3164.44ms. Allocated memory was 186.6MB in the beginning and 237.0MB in the end (delta: 50.3MB). Free memory was 132.9MB in the beginning and 167.8MB in the end (delta: -34.9MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2022-04-28 02:00:14,327 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:00:14,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.72ms. Allocated memory is still 186.6MB. Free memory was 132.6MB in the beginning and 161.6MB in the end (delta: -29.0MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-28 02:00:14,328 INFO L158 Benchmark]: Boogie Preprocessor took 39.40ms. Allocated memory is still 186.6MB. Free memory was 161.6MB in the beginning and 160.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 02:00:14,328 INFO L158 Benchmark]: RCFGBuilder took 241.93ms. Allocated memory is still 186.6MB. Free memory was 160.2MB in the beginning and 148.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 02:00:14,328 INFO L158 Benchmark]: IcfgTransformer took 47.39ms. Allocated memory is still 186.6MB. Free memory was 148.7MB in the beginning and 146.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:00:14,329 INFO L158 Benchmark]: TraceAbstraction took 2599.55ms. Allocated memory was 186.6MB in the beginning and 237.0MB in the end (delta: 50.3MB). Free memory was 146.5MB in the beginning and 167.8MB in the end (delta: -21.3MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-04-28 02:00:14,330 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 186.6MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.72ms. Allocated memory is still 186.6MB. Free memory was 132.6MB in the beginning and 161.6MB in the end (delta: -29.0MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.40ms. Allocated memory is still 186.6MB. Free memory was 161.6MB in the beginning and 160.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 241.93ms. Allocated memory is still 186.6MB. Free memory was 160.2MB in the beginning and 148.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 47.39ms. Allocated memory is still 186.6MB. Free memory was 148.7MB in the beginning and 146.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2599.55ms. Allocated memory was 186.6MB in the beginning and 237.0MB in the end (delta: 50.3MB). Free memory was 146.5MB in the beginning and 167.8MB in the end (delta: -21.3MB). Peak memory consumption was 30.4MB. 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: 150]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 180 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 228 mSDtfsCounter, 180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 32 NumberOfFragments, 102 HoareAnnotationTreeSize, 11 FomulaSimplifications, 33 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 50 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 42/42 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: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: -2 + blastFlag == 0 || blastFlag == 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (blastFlag == 0 || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || 2 == blastFlag - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state) || (blastFlag == 0 && 8640 <= s__state)) || (-2 + blastFlag == 0 && 8640 <= s__state) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: (((3 == blastFlag && !(s__hit == 0)) && 8656 <= s__state) || (blastFlag == 0 && 8656 <= s__state)) || (2 == blastFlag && 8656 <= s__state) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: -2 + blastFlag == 0 || blastFlag == 0 RESULT: Ultimate proved your program to be correct! [2022-04-28 02:00:14,360 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...