/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/bhmr2007.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:39:21,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:39:21,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:39:21,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:39:21,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:39:21,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:39:21,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:39:21,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:39:21,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:39:21,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:39:21,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:39:21,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:39:21,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:39:21,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:39:21,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:39:21,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:39:21,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:39:21,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:39:21,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:39:21,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:39:21,508 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:39:21,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:39:21,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:39:21,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:39:21,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:39:21,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:39:21,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:39:21,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:39:21,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:39:21,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:39:21,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:39:21,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:39:21,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:39:21,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:39:21,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:39:21,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:39:21,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:39:21,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:39:21,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:39:21,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:39:21,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:39:21,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:39:21,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:39:21,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:39:21,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:39:21,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:39:21,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:39:21,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:39:21,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:39:21,535 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:39:21,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:39:21,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:39:21,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:39:21,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:39:21,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:39:21,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:39:21,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:39:21,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:39:21,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:39:21,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:39:21,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:39:21,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:39:21,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:39:21,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:39:21,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:39:21,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:39:21,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:39:21,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:39:21,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:39:21,537 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:39:21,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:39:21,538 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:39:21,538 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:39:21,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:39:21,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:39:21,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:39:21,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:39:21,752 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:39:21,753 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007.i [2022-04-27 21:39:21,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566cc2296/95872254570b40409035a424c8156acf/FLAGe2a6484f6 [2022-04-27 21:39:22,090 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:39:22,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i [2022-04-27 21:39:22,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566cc2296/95872254570b40409035a424c8156acf/FLAGe2a6484f6 [2022-04-27 21:39:22,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566cc2296/95872254570b40409035a424c8156acf [2022-04-27 21:39:22,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:39:22,547 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:39:22,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:39:22,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:39:22,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:39:22,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:39:22" (1/1) ... [2022-04-27 21:39:22,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7826c985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:22, skipping insertion in model container [2022-04-27 21:39:22,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:39:22" (1/1) ... [2022-04-27 21:39:22,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:39:22,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:39:22,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i[895,908] [2022-04-27 21:39:22,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:39:22,788 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:39:22,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i[895,908] [2022-04-27 21:39:22,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:39:22,839 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:39:22,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:22 WrapperNode [2022-04-27 21:39:22,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:39:22,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:39:22,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:39:22,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:39:22,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:22" (1/1) ... [2022-04-27 21:39:22,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:22" (1/1) ... [2022-04-27 21:39:22,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:22" (1/1) ... [2022-04-27 21:39:22,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:22" (1/1) ... [2022-04-27 21:39:22,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:22" (1/1) ... [2022-04-27 21:39:22,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:22" (1/1) ... [2022-04-27 21:39:22,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:22" (1/1) ... [2022-04-27 21:39:22,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:39:22,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:39:22,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:39:22,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:39:22,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:22" (1/1) ... [2022-04-27 21:39:22,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:39:22,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:39:22,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:39:22,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:39:22,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:39:22,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:39:22,926 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:39:22,927 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:39:22,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:39:22,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:39:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:39:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:39:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:39:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:39:22,927 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:39:22,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:39:22,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:39:22,990 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:39:22,991 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:39:23,079 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:39:23,095 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:39:23,096 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:39:23,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:39:23 BoogieIcfgContainer [2022-04-27 21:39:23,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:39:23,097 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:39:23,098 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:39:23,098 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:39:23,100 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:39:23" (1/1) ... [2022-04-27 21:39:23,101 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:39:23,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:39:23 BasicIcfg [2022-04-27 21:39:23,152 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:39:23,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:39:23,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:39:23,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:39:23,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:39:22" (1/4) ... [2022-04-27 21:39:23,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5593e6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:39:23, skipping insertion in model container [2022-04-27 21:39:23,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:22" (2/4) ... [2022-04-27 21:39:23,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5593e6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:39:23, skipping insertion in model container [2022-04-27 21:39:23,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:39:23" (3/4) ... [2022-04-27 21:39:23,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5593e6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:39:23, skipping insertion in model container [2022-04-27 21:39:23,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:39:23" (4/4) ... [2022-04-27 21:39:23,166 INFO L111 eAbstractionObserver]: Analyzing ICFG bhmr2007.iqvasr [2022-04-27 21:39:23,177 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:39:23,178 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:39:23,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:39:23,210 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@11ad3e4a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@381c7b0 [2022-04-27 21:39:23,210 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:39:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:39:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:39:23,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:23,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:23,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:23,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:23,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1670666048, now seen corresponding path program 1 times [2022-04-27 21:39:23,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:23,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388392363] [2022-04-27 21:39:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:23,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:23,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:23,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {25#true} is VALID [2022-04-27 21:39:23,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:39:23,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:39:23,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:23,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {25#true} is VALID [2022-04-27 21:39:23,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:39:23,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:39:23,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:39:23,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {25#true} is VALID [2022-04-27 21:39:23,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 21:39:23,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} [73] L28-2-->L28-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 21:39:23,423 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {26#false} is VALID [2022-04-27 21:39:23,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-27 21:39:23,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 21:39:23,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 21:39:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:23,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:23,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388392363] [2022-04-27 21:39:23,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388392363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:39:23,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:39:23,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:39:23,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604592629] [2022-04-27 21:39:23,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:39:23,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:39:23,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:23,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:23,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:23,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:39:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:23,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:39:23,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:39:23,479 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:23,549 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 21:39:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:39:23,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:39:23,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 21:39:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 21:39:23,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-27 21:39:23,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:23,634 INFO L225 Difference]: With dead ends: 34 [2022-04-27 21:39:23,635 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 21:39:23,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:39:23,640 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:39:23,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:39:23,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 21:39:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 21:39:23,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:23,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:23,662 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:23,662 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:23,664 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 21:39:23,664 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:39:23,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:23,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:23,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:39:23,665 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 21:39:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:23,667 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 21:39:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:39:23,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:23,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:23,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:23,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 21:39:23,670 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 21:39:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:23,670 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 21:39:23,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:39:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:39:23,671 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:23,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:23,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:39:23,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:23,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1671589569, now seen corresponding path program 1 times [2022-04-27 21:39:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:23,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857577308] [2022-04-27 21:39:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:23,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:23,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:23,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {128#true} is VALID [2022-04-27 21:39:23,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:39:23,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128#true} {128#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:39:23,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {128#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:23,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {128#true} is VALID [2022-04-27 21:39:23,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:39:23,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:39:23,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {128#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-04-27 21:39:23,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {133#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:23,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {134#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 21:39:23,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {134#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {135#(and (= main_~a~0 0) (= main_~b~0 0) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 21:39:23,873 INFO L272 TraceCheckUtils]: 8: Hoare triple {135#(and (= main_~a~0 0) (= main_~b~0 0) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {136#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:39:23,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {137#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:39:23,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {137#(not (= __VERIFIER_assert_~cond 0))} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {129#false} is VALID [2022-04-27 21:39:23,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {129#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#false} is VALID [2022-04-27 21:39:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:23,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:23,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857577308] [2022-04-27 21:39:23,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857577308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:39:23,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:39:23,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 21:39:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411651938] [2022-04-27 21:39:23,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:39:23,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:39:23,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:23,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:23,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:23,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:39:23,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:23,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:39:23,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:39:23,890 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:24,113 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 21:39:24,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:39:24,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:39:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-27 21:39:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-27 21:39:24,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2022-04-27 21:39:24,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:24,135 INFO L225 Difference]: With dead ends: 22 [2022-04-27 21:39:24,135 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 21:39:24,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:39:24,136 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:39:24,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:39:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 21:39:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-27 21:39:24,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:24,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:24,141 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:24,141 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:24,142 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 21:39:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:39:24,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:24,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:24,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 21:39:24,143 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 21:39:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:24,144 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 21:39:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:39:24,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:24,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:24,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:24,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 21:39:24,146 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-27 21:39:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:24,146 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 21:39:24,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 21:39:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:39:24,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:24,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:24,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:39:24,147 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:24,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash 830449136, now seen corresponding path program 1 times [2022-04-27 21:39:24,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:24,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550199739] [2022-04-27 21:39:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:24,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {241#true} is VALID [2022-04-27 21:39:24,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {241#true} {241#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {241#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:24,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {241#true} is VALID [2022-04-27 21:39:24,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:24,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:24,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {247#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:24,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {248#(and (= main_~i~0 0) (or (<= 3 (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 21:39:24,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#(and (= main_~i~0 0) (or (<= 3 (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {249#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} is VALID [2022-04-27 21:39:24,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {250#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 21:39:24,306 INFO L272 TraceCheckUtils]: 11: Hoare triple {250#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {251#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:39:24,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {251#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {252#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:39:24,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {252#(not (= __VERIFIER_assert_~cond 0))} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {242#false} is VALID [2022-04-27 21:39:24,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242#false} is VALID [2022-04-27 21:39:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:24,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550199739] [2022-04-27 21:39:24,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550199739] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:39:24,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603061525] [2022-04-27 21:39:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:24,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:39:24,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:39:24,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:39:24,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:39:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:24,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 21:39:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:24,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:39:24,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {241#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {241#true} is VALID [2022-04-27 21:39:24,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:24,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:24,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {247#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:24,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {281#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 2) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:24,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {281#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 2) (= (+ (- 1) main_~a~0) 0) (= main_~i~0 0))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {285#(and (<= 1 main_~n~0) (= main_~b~0 2) (<= main_~i~0 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 21:39:24,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#(and (<= 1 main_~n~0) (= main_~b~0 2) (<= main_~i~0 1) (= (+ (- 1) main_~a~0) 0))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {289#(and (<= 1 main_~n~0) (= main_~b~0 2) (= (+ (- 1) main_~a~0) 0) (<= main_~n~0 1))} is VALID [2022-04-27 21:39:24,648 INFO L272 TraceCheckUtils]: 11: Hoare triple {289#(and (<= 1 main_~n~0) (= main_~b~0 2) (= (+ (- 1) main_~a~0) 0) (<= main_~n~0 1))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:39:24,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:39:24,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {242#false} is VALID [2022-04-27 21:39:24,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242#false} is VALID [2022-04-27 21:39:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:24,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:39:24,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {242#false} is VALID [2022-04-27 21:39:24,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {297#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {242#false} is VALID [2022-04-27 21:39:24,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {297#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:39:24,915 INFO L272 TraceCheckUtils]: 11: Hoare triple {250#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {293#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:39:24,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {316#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {250#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 21:39:24,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {316#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 21:39:24,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {324#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {320#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 21:39:24,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {328#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {324#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} is VALID [2022-04-27 21:39:24,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {328#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {328#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} is VALID [2022-04-27 21:39:24,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {328#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} is VALID [2022-04-27 21:39:24,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {241#true} is VALID [2022-04-27 21:39:24,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {241#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#true} is VALID [2022-04-27 21:39:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:24,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603061525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:39:24,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:39:24,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-27 21:39:24,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886163495] [2022-04-27 21:39:24,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:39:24,921 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:39:24,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:24,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:24,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:24,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 21:39:24,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:24,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 21:39:24,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-27 21:39:24,946 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:25,570 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-27 21:39:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 21:39:25,571 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:39:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-27 21:39:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-27 21:39:25,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 37 transitions. [2022-04-27 21:39:25,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:25,606 INFO L225 Difference]: With dead ends: 31 [2022-04-27 21:39:25,606 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 21:39:25,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 21:39:25,607 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:39:25,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 57 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:39:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 21:39:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-27 21:39:25,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:25,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:25,615 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:25,615 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:25,616 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 21:39:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 21:39:25,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:25,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:25,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-27 21:39:25,617 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-27 21:39:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:25,618 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 21:39:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 21:39:25,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:25,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:25,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:25,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-27 21:39:25,619 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2022-04-27 21:39:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:25,619 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-27 21:39:25,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-27 21:39:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:39:25,620 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:25,620 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:25,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:39:25,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:39:25,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:25,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash -941499008, now seen corresponding path program 1 times [2022-04-27 21:39:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:25,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334086245] [2022-04-27 21:39:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:25,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:26,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {507#true} is VALID [2022-04-27 21:39:26,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {507#true} {507#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:26,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {507#true} is VALID [2022-04-27 21:39:26,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:26,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:26,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:26,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [78] L29-->L29-2: Formula: (and (= v_main_~b~0_1 (+ v_main_~b~0_2 1)) (= |v_main_#t~nondet2_2| 0) (= (+ v_main_~a~0_2 2) v_main_~a~0_1)) InVars {main_~b~0=v_main_~b~0_2, main_#t~nondet2=|v_main_#t~nondet2_2|, main_~a~0=v_main_~a~0_2} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {513#(and (<= (+ main_~b~0 main_~a~0) 3) (<= 3 (+ main_~b~0 main_~a~0)) (= main_~i~0 0))} is VALID [2022-04-27 21:39:26,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {513#(and (<= (+ main_~b~0 main_~a~0) 3) (<= 3 (+ main_~b~0 main_~a~0)) (= main_~i~0 0))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 21:39:26,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {515#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0 3) (* main_~n~0 3)))} is VALID [2022-04-27 21:39:26,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0 3) (* main_~n~0 3)))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {516#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (or (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 21:39:26,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {516#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (or (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {517#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} is VALID [2022-04-27 21:39:26,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {517#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {518#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 21:39:26,010 INFO L272 TraceCheckUtils]: 14: Hoare triple {518#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {519#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:39:26,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {520#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:39:26,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {520#(not (= __VERIFIER_assert_~cond 0))} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {508#false} is VALID [2022-04-27 21:39:26,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {508#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#false} is VALID [2022-04-27 21:39:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:26,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:26,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334086245] [2022-04-27 21:39:26,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334086245] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:39:26,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296477214] [2022-04-27 21:39:26,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:26,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:39:26,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:39:26,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:39:26,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 21:39:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:26,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 21:39:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:26,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:39:26,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {507#true} is VALID [2022-04-27 21:39:26,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:26,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:26,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-27 21:39:26,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} [78] L29-->L29-2: Formula: (and (= v_main_~b~0_1 (+ v_main_~b~0_2 1)) (= |v_main_#t~nondet2_2| 0) (= (+ v_main_~a~0_2 2) v_main_~a~0_1)) InVars {main_~b~0=v_main_~b~0_2, main_#t~nondet2=|v_main_#t~nondet2_2|, main_~a~0=v_main_~a~0_2} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {549#(and (= main_~i~0 0) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-27 21:39:26,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {549#(and (= main_~i~0 0) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {553#(and (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-27 21:39:26,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#(and (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {557#(and (< main_~i~0 main_~n~0) (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-27 21:39:26,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {557#(and (< main_~i~0 main_~n~0) (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {561#(and (< main_~i~0 main_~n~0) (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (= main_~i~0 1))} is VALID [2022-04-27 21:39:26,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(and (< main_~i~0 main_~n~0) (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (= main_~i~0 1))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {565#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (< 1 main_~n~0) (<= main_~i~0 2))} is VALID [2022-04-27 21:39:26,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {565#(and (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (< 1 main_~n~0) (<= main_~i~0 2))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {569#(and (<= main_~n~0 2) (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (< 1 main_~n~0))} is VALID [2022-04-27 21:39:26,370 INFO L272 TraceCheckUtils]: 14: Hoare triple {569#(and (<= main_~n~0 2) (= (+ (- 1) main_~a~0) 2) (= (+ main_~b~0 (- 3)) 0) (< 1 main_~n~0))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {573#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:39:26,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {573#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {577#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:39:26,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {577#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {508#false} is VALID [2022-04-27 21:39:26,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {508#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#false} is VALID [2022-04-27 21:39:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:26,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:39:26,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {508#false} [84] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {508#false} is VALID [2022-04-27 21:39:26,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {577#(<= 1 __VERIFIER_assert_~cond)} [82] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {508#false} is VALID [2022-04-27 21:39:26,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {573#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {577#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:39:26,686 INFO L272 TraceCheckUtils]: 14: Hoare triple {518#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} [76] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (* v_main_~n~0_9 3) (+ v_main_~a~0_9 v_main_~b~0_9)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~n~0=v_main_~n~0_9, main_~b~0=v_main_~b~0_9, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~b~0, main_~a~0] {573#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:39:26,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {596#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} [74] L28-2-->L28-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {518#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 21:39:26,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {600#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {596#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 21:39:26,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} [77] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_5| 0)) (= v_main_~b~0_7 (+ v_main_~b~0_8 2)) (= v_main_~a~0_7 (+ v_main_~a~0_8 1))) InVars {main_~b~0=v_main_~b~0_8, main_#t~nondet2=|v_main_#t~nondet2_5|, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {600#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 21:39:26,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {604#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} is VALID [2022-04-27 21:39:26,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {611#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} [81] L29-2-->L28-2: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0] {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 21:39:26,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} [78] L29-->L29-2: Formula: (and (= v_main_~b~0_1 (+ v_main_~b~0_2 1)) (= |v_main_#t~nondet2_2| 0) (= (+ v_main_~a~0_2 2) v_main_~a~0_1)) InVars {main_~b~0=v_main_~b~0_2, main_#t~nondet2=|v_main_#t~nondet2_2|, main_~a~0=v_main_~a~0_2} OutVars{main_~b~0=v_main_~b~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet2, main_~b~0, main_~a~0] {611#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 21:39:26,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} [75] L28-2-->L29: Formula: (and (<= |v_main_#t~nondet2_3| 2147483647) (< v_main_~i~0_4 v_main_~n~0_5) (<= 0 (+ |v_main_#t~nondet2_3| 2147483648))) InVars {main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~nondet2=|v_main_#t~nondet2_3|} AuxVars[] AssignedVars[] {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 21:39:26,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} [71] L27-->L28-2: Formula: (and (<= v_main_~n~0_2 1000000) (<= 0 v_main_~n~0_2)) InVars {main_~n~0=v_main_~n~0_2} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 21:39:26,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} [68] mainENTRY-->L27: Formula: (and (= v_main_~i~0_5 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_6 |v_main_#t~nondet1_2|) (= v_main_~a~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~b~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_6, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_#t~nondet1, main_~i~0, main_~n~0, main_~b~0, main_~a~0] {514#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-27 21:39:26,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} [87] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= (select |v_#length_1| 2) 9) (= (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] {507#true} is VALID [2022-04-27 21:39:26,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#true} is VALID [2022-04-27 21:39:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 21:39:26,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296477214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:39:26,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:39:26,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2022-04-27 21:39:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503909957] [2022-04-27 21:39:26,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:39:26,692 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:39:26,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:26,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:26,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:26,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 21:39:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:26,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 21:39:26,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-04-27 21:39:26,721 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:27,494 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 21:39:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 21:39:27,494 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:39:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2022-04-27 21:39:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2022-04-27 21:39:27,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 30 transitions. [2022-04-27 21:39:27,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:27,522 INFO L225 Difference]: With dead ends: 29 [2022-04-27 21:39:27,522 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:39:27,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1396, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 21:39:27,524 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:39:27,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 80 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:39:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:39:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:39:27,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:27,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:27,525 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:27,525 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:27,525 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:39:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:39:27,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:27,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:27,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:39:27,525 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:39:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:27,526 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:39:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:39:27,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:27,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:27,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:27,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:39:27,526 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-27 21:39:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:27,526 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:39:27,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:39:27,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:27,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:39:27,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:39:27,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 21:39:27,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:39:27,822 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:39:27,823 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:39:27,823 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:39:27,823 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:39:27,823 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:39:27,824 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:39:27,824 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:39:27,824 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 40) the Hoare annotation is: true [2022-04-27 21:39:27,824 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-27 21:39:27,824 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 40) no Hoare annotation was computed. [2022-04-27 21:39:27,824 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse1 (+ main_~b~0 main_~a~0)) (.cse0 (* main_~i~0 3))) (and (<= .cse0 .cse1) (< .cse1 (+ (* main_~n~0 3) 1)) (<= .cse1 .cse0))) [2022-04-27 21:39:27,824 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 40) no Hoare annotation was computed. [2022-04-27 21:39:27,824 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse1 (* main_~n~0 3)) (.cse0 (+ main_~b~0 main_~a~0))) (and (< .cse0 (+ .cse1 1)) (<= .cse1 .cse0))) [2022-04-27 21:39:27,824 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 35) no Hoare annotation was computed. [2022-04-27 21:39:27,824 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-04-27 21:39:27,824 INFO L899 garLoopResultBuilder]: For program point L29-2(lines 29 35) no Hoare annotation was computed. [2022-04-27 21:39:27,824 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:39:27,824 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:39:27,825 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:39:27,825 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:39:27,825 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:39:27,825 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:39:27,827 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 21:39:27,829 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:39:27,832 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:39:27,832 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 21:39:27,832 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:39:27,833 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:39:27,833 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 21:39:27,833 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 21:39:27,833 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:39:27,833 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:39:27,833 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:39:27,833 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:39:27,836 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 21:39:27,836 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:39:27,836 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:39:27,836 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:39:27,836 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:39:27,836 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 21:39:27,836 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 21:39:27,836 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:39:27,836 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:39:27,836 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-27 21:39:27,836 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 21:39:27,836 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:39:27,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:39:27 BasicIcfg [2022-04-27 21:39:27,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:39:27,847 INFO L158 Benchmark]: Toolchain (without parser) took 5299.53ms. Allocated memory was 180.4MB in the beginning and 225.4MB in the end (delta: 45.1MB). Free memory was 123.2MB in the beginning and 104.7MB in the end (delta: 18.5MB). Peak memory consumption was 63.7MB. Max. memory is 8.0GB. [2022-04-27 21:39:27,847 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:39:27,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.64ms. Allocated memory was 180.4MB in the beginning and 225.4MB in the end (delta: 45.1MB). Free memory was 123.0MB in the beginning and 198.8MB in the end (delta: -75.8MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2022-04-27 21:39:27,847 INFO L158 Benchmark]: Boogie Preprocessor took 19.75ms. Allocated memory is still 225.4MB. Free memory was 198.8MB in the beginning and 197.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:39:27,847 INFO L158 Benchmark]: RCFGBuilder took 235.07ms. Allocated memory is still 225.4MB. Free memory was 197.2MB in the beginning and 185.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 21:39:27,848 INFO L158 Benchmark]: IcfgTransformer took 54.51ms. Allocated memory is still 225.4MB. Free memory was 185.2MB in the beginning and 183.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:39:27,848 INFO L158 Benchmark]: TraceAbstraction took 4683.72ms. Allocated memory is still 225.4MB. Free memory was 183.1MB in the beginning and 104.7MB in the end (delta: 78.4MB). Peak memory consumption was 78.9MB. Max. memory is 8.0GB. [2022-04-27 21:39:27,858 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.09ms. Allocated memory is still 180.4MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.64ms. Allocated memory was 180.4MB in the beginning and 225.4MB in the end (delta: 45.1MB). Free memory was 123.0MB in the beginning and 198.8MB in the end (delta: -75.8MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.75ms. Allocated memory is still 225.4MB. Free memory was 198.8MB in the beginning and 197.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 235.07ms. Allocated memory is still 225.4MB. Free memory was 197.2MB in the beginning and 185.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 54.51ms. Allocated memory is still 225.4MB. Free memory was 185.2MB in the beginning and 183.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4683.72ms. Allocated memory is still 225.4MB. Free memory was 183.1MB in the beginning and 104.7MB in the end (delta: 78.4MB). Peak memory consumption was 78.9MB. 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 52 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 52 HoareAnnotationTreeSize, 12 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 337 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 926 SizeOfPredicates, 6 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (i * 3 <= b + a && b + a < n * 3 + 1) && b + a <= i * 3 RESULT: Ultimate proved your program to be correct! [2022-04-27 21:39:27,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...