/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-zilu/benchmark05_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:30:50,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:30:50,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:30:50,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:30:50,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:30:50,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:30:50,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:30:50,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:30:50,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:30:50,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:30:50,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:30:50,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:30:50,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:30:50,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:30:50,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:30:50,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:30:50,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:30:50,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:30:50,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:30:50,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:30:50,511 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:30:50,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:30:50,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:30:50,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:30:50,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:30:50,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:30:50,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:30:50,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:30:50,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:30:50,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:30:50,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:30:50,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:30:50,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:30:50,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:30:50,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:30:50,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:30:50,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:30:50,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:30:50,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:30:50,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:30:50,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:30:50,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:30:50,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:30:50,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:30:50,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:30:50,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:30:50,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:30:50,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:30:50,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:30:50,551 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:30:50,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:30:50,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:30:50,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:30:50,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:30:50,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:30:50,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:30:50,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:30:50,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:30:50,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:30:50,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:30:50,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:30:50,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:30:50,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:30:50,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:30:50,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:30:50,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:30:50,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:30:50,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:30:50,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:30:50,554 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:30:50,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:30:50,555 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:30:50,555 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-07 23:30:50,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:30:50,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:30:50,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:30:50,759 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:30:50,760 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:30:50,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i [2022-04-07 23:30:50,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69242eed/967448e822254b13adb2e23ba3b8668c/FLAG797f72629 [2022-04-07 23:30:51,173 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:30:51,174 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i [2022-04-07 23:30:51,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69242eed/967448e822254b13adb2e23ba3b8668c/FLAG797f72629 [2022-04-07 23:30:51,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b69242eed/967448e822254b13adb2e23ba3b8668c [2022-04-07 23:30:51,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:30:51,189 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:30:51,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:30:51,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:30:51,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:30:51,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:30:51" (1/1) ... [2022-04-07 23:30:51,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18cb0f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:51, skipping insertion in model container [2022-04-07 23:30:51,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:30:51" (1/1) ... [2022-04-07 23:30:51,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:30:51,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:30:51,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark05_conjunctive.i[873,886] [2022-04-07 23:30:51,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:30:51,367 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:30:51,378 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-zilu/benchmark05_conjunctive.i[873,886] [2022-04-07 23:30:51,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:30:51,395 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:30:51,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:51 WrapperNode [2022-04-07 23:30:51,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:30:51,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:30:51,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:30:51,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:30:51,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:51" (1/1) ... [2022-04-07 23:30:51,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:51" (1/1) ... [2022-04-07 23:30:51,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:51" (1/1) ... [2022-04-07 23:30:51,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:51" (1/1) ... [2022-04-07 23:30:51,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:51" (1/1) ... [2022-04-07 23:30:51,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:51" (1/1) ... [2022-04-07 23:30:51,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:51" (1/1) ... [2022-04-07 23:30:51,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:30:51,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:30:51,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:30:51,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:30:51,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:51" (1/1) ... [2022-04-07 23:30:51,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:30:51,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:30:51,460 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-07 23:30:51,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 23:30:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:30:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:30:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:30:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:30:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:30:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:30:51,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:30:51,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:30:51,525 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:30:51,526 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:30:51,632 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:30:51,637 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:30:51,638 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 23:30:51,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:30:51 BoogieIcfgContainer [2022-04-07 23:30:51,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:30:51,639 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:30:51,640 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:30:51,640 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:30:51,642 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:30:51" (1/1) ... [2022-04-07 23:30:51,644 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:30:51,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:30:51 BasicIcfg [2022-04-07 23:30:51,662 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:30:51,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:30:51,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:30:51,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:30:51,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:30:51" (1/4) ... [2022-04-07 23:30:51,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@823500d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:30:51, skipping insertion in model container [2022-04-07 23:30:51,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:30:51" (2/4) ... [2022-04-07 23:30:51,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@823500d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:30:51, skipping insertion in model container [2022-04-07 23:30:51,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:30:51" (3/4) ... [2022-04-07 23:30:51,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@823500d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:30:51, skipping insertion in model container [2022-04-07 23:30:51,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:30:51" (4/4) ... [2022-04-07 23:30:51,667 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark05_conjunctive.iqvasr [2022-04-07 23:30:51,670 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:30:51,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:30:51,697 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:30:51,701 INFO L340 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 [2022-04-07 23:30:51,701 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:30:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-07 23:30:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:30:51,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:30:51,717 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:30:51,717 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:30:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:30:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash 713533472, now seen corresponding path program 1 times [2022-04-07 23:30:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:30:51,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808159697] [2022-04-07 23:30:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:30:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:30:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:51,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:30:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:51,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {24#true} is VALID [2022-04-07 23:30:51,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:30:51,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:30:51,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [54] 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-07 23:30:51,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {24#true} is VALID [2022-04-07 23:30:51,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:30:51,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:30:51,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-07 23:30:51,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [58] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_3, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~y~0, main_~n~0] {24#true} is VALID [2022-04-07 23:30:51,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [61] L23-->L26-2: Formula: (and (<= 0 v_main_~x~0_8) (< v_main_~y~0_6 v_main_~n~0_5) (<= v_main_~x~0_8 v_main_~y~0_6)) InVars {main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {29#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-07 23:30:51,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(<= (+ main_~x~0 1) main_~n~0)} [64] L26-2-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 23:30:51,947 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} [66] L24-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~y~0_8) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {25#false} is VALID [2022-04-07 23:30:51,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-07 23:30:51,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [71] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 23:30:51,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [73] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-07 23:30:51,948 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-07 23:30:51,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:30:51,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808159697] [2022-04-07 23:30:51,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808159697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:30:51,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:30:51,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 23:30:51,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576657669] [2022-04-07 23:30:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:30:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 23:30:51,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:30:51,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 23:30:51,976 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-07 23:30:51,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 23:30:51,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:30:51,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 23:30:51,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 23:30:51,993 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 23:30:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:52,109 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-07 23:30:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 23:30:52,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 23:30:52,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:30:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 23:30:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-07 23:30:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 23:30:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-07 23:30:52,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-07 23:30:52,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:30:52,190 INFO L225 Difference]: With dead ends: 34 [2022-04-07 23:30:52,190 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 23:30:52,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 23:30:52,199 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:30:52,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 30 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:30:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 23:30:52,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 23:30:52,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:30:52,226 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-07 23:30:52,226 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-07 23:30:52,226 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-07 23:30:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:52,232 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 23:30:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 23:30:52,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:52,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:52,233 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-07 23:30:52,233 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-07 23:30:52,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:52,235 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 23:30:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 23:30:52,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:52,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:52,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:30:52,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:30:52,236 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-07 23:30:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-07 23:30:52,238 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-07 23:30:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:30:52,238 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-07 23:30:52,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-07 23:30:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 23:30:52,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 23:30:52,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:30:52,239 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:30:52,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:30:52,239 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:30:52,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:30:52,240 INFO L85 PathProgramCache]: Analyzing trace with hash -578658626, now seen corresponding path program 1 times [2022-04-07 23:30:52,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:30:52,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040739520] [2022-04-07 23:30:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:30:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:30:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:52,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:30:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:52,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {132#true} is VALID [2022-04-07 23:30:52,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:52,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {132#true} {132#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:52,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:30:52,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {132#true} is VALID [2022-04-07 23:30:52,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:52,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:52,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:52,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#true} [58] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_3, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~y~0, main_~n~0] {132#true} is VALID [2022-04-07 23:30:52,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} [61] L23-->L26-2: Formula: (and (<= 0 v_main_~x~0_8) (< v_main_~y~0_6 v_main_~n~0_5) (<= v_main_~x~0_8 v_main_~y~0_6)) InVars {main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {137#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-07 23:30:52,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} [65] L26-2-->L26: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {138#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-07 23:30:52,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {138#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} [67] L26-->L26-2: Formula: (and (< v_main_~y~0_3 v_main_~x~0_5) (= v_main_~y~0_2 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {139#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} is VALID [2022-04-07 23:30:52,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {139#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} [64] L26-2-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 23:30:52,431 INFO L272 TraceCheckUtils]: 10: Hoare triple {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} [66] L24-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~y~0_8) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:30:52,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#(not (= |__VERIFIER_assert_#in~cond| 0))} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {142#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:30:52,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {142#(not (= __VERIFIER_assert_~cond 0))} [71] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {133#false} is VALID [2022-04-07 23:30:52,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {133#false} [73] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#false} is VALID [2022-04-07 23:30:52,433 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-07 23:30:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:30:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040739520] [2022-04-07 23:30:52,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040739520] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:30:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305520962] [2022-04-07 23:30:52,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:30:52,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:30:52,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:30:52,435 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-07 23:30:52,449 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-07 23:30:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:52,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 23:30:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:52,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:30:52,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:52,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} [56] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {132#true} is VALID [2022-04-07 23:30:52,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:52,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:52,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:52,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#true} [58] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_3, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~y~0, main_~n~0] {132#true} is VALID [2022-04-07 23:30:52,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} [61] L23-->L26-2: Formula: (and (<= 0 v_main_~x~0_8) (< v_main_~y~0_6 v_main_~n~0_5) (<= v_main_~x~0_8 v_main_~y~0_6)) InVars {main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {137#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-07 23:30:52,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 main_~y~0))} [65] L26-2-->L26: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {138#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-07 23:30:52,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {138#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} [67] L26-->L26-2: Formula: (and (< v_main_~y~0_3 v_main_~x~0_5) (= v_main_~y~0_2 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {171#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} is VALID [2022-04-07 23:30:52,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} [64] L26-2-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 23:30:52,883 INFO L272 TraceCheckUtils]: 10: Hoare triple {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} [66] L24-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~y~0_8) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {178#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:30:52,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {178#(<= 1 |__VERIFIER_assert_#in~cond|)} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {182#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:30:52,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {182#(<= 1 __VERIFIER_assert_~cond)} [71] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {133#false} is VALID [2022-04-07 23:30:52,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {133#false} [73] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#false} is VALID [2022-04-07 23:30:52,886 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-07 23:30:52,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:30:53,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {133#false} [73] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {133#false} is VALID [2022-04-07 23:30:53,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {182#(<= 1 __VERIFIER_assert_~cond)} [71] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {133#false} is VALID [2022-04-07 23:30:53,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {178#(<= 1 |__VERIFIER_assert_#in~cond|)} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {182#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:30:53,139 INFO L272 TraceCheckUtils]: 10: Hoare triple {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} [66] L24-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~y~0_8) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {178#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:30:53,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} [64] L26-2-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {140#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 23:30:53,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {205#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} [67] L26-->L26-2: Formula: (and (< v_main_~y~0_3 v_main_~x~0_5) (= v_main_~y~0_2 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {201#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} is VALID [2022-04-07 23:30:53,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {209#(or (< (+ main_~x~0 1) main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} [65] L26-2-->L26: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {205#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} is VALID [2022-04-07 23:30:53,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#true} [61] L23-->L26-2: Formula: (and (<= 0 v_main_~x~0_8) (< v_main_~y~0_6 v_main_~n~0_5) (<= v_main_~x~0_8 v_main_~y~0_6)) InVars {main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {209#(or (< (+ main_~x~0 1) main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} is VALID [2022-04-07 23:30:53,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {132#true} [58] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_3, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~y~0, main_~n~0] {132#true} is VALID [2022-04-07 23:30:53,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {132#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:53,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:53,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:53,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} [56] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {132#true} is VALID [2022-04-07 23:30:53,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {132#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#true} is VALID [2022-04-07 23:30:53,148 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-07 23:30:53,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305520962] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:30:53,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:30:53,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-07 23:30:53,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205224449] [2022-04-07 23:30:53,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:30:53,150 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 23:30:53,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:30:53,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:30:53,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:30:53,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 23:30:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:30:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 23:30:53,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-07 23:30:53,169 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:30:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:53,394 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-07 23:30:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 23:30:53,395 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 23:30:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:30:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:30:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-04-07 23:30:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:30:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-04-07 23:30:53,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 28 transitions. [2022-04-07 23:30:53,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:30:53,423 INFO L225 Difference]: With dead ends: 26 [2022-04-07 23:30:53,423 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 23:30:53,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-04-07 23:30:53,425 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:30:53,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 42 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:30:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 23:30:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-07 23:30:53,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:30:53,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-07 23:30:53,430 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-07 23:30:53,430 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-07 23:30:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:53,431 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 23:30:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 23:30:53,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:53,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:53,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-07 23:30:53,432 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-07 23:30:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:53,433 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 23:30:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 23:30:53,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:53,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:53,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:30:53,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:30:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-07 23:30:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-07 23:30:53,435 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-04-07 23:30:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:30:53,435 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-07 23:30:53,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:30:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 23:30:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 23:30:53,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:30:53,436 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:30:53,454 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-07 23:30:53,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:30:53,652 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:30:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:30:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1129716260, now seen corresponding path program 2 times [2022-04-07 23:30:53,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:30:53,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761658983] [2022-04-07 23:30:53,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:30:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:30:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:53,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:30:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:53,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {347#true} is VALID [2022-04-07 23:30:53,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:53,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {347#true} {347#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:53,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:30:53,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [56] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {347#true} is VALID [2022-04-07 23:30:53,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:53,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:53,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:53,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} [58] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_3, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~y~0, main_~n~0] {347#true} is VALID [2022-04-07 23:30:53,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#true} [61] L23-->L26-2: Formula: (and (<= 0 v_main_~x~0_8) (< v_main_~y~0_6 v_main_~n~0_5) (<= v_main_~x~0_8 v_main_~y~0_6)) InVars {main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {352#(<= main_~x~0 main_~y~0)} is VALID [2022-04-07 23:30:53,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(<= main_~x~0 main_~y~0)} [65] L26-2-->L26: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {353#(<= main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-07 23:30:53,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(<= main_~x~0 (+ main_~y~0 1))} [67] L26-->L26-2: Formula: (and (< v_main_~y~0_3 v_main_~x~0_5) (= v_main_~y~0_2 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-07 23:30:53,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} [65] L26-2-->L26: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {355#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-07 23:30:53,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} [67] L26-->L26-2: Formula: (and (< v_main_~y~0_3 v_main_~x~0_5) (= v_main_~y~0_2 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {356#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} is VALID [2022-04-07 23:30:53,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {356#(and (or (<= main_~x~0 main_~y~0) (<= main_~n~0 main_~y~0)) (< main_~y~0 (+ main_~n~0 1)))} [64] L26-2-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 23:30:53,817 INFO L272 TraceCheckUtils]: 12: Hoare triple {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} [66] L24-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~y~0_8) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {358#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:30:53,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#(not (= |__VERIFIER_assert_#in~cond| 0))} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {359#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:30:53,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {359#(not (= __VERIFIER_assert_~cond 0))} [71] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-07 23:30:53,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} [73] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-07 23:30:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:30:53,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:30:53,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761658983] [2022-04-07 23:30:53,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761658983] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:30:53,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015039154] [2022-04-07 23:30:53,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 23:30:53,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:30:53,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:30:53,820 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-07 23:30:53,821 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-07 23:30:53,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 23:30:53,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 23:30:53,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 23:30:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:30:53,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:30:54,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:54,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} [56] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {347#true} is VALID [2022-04-07 23:30:54,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:54,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:54,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:54,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} [58] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_3, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~y~0, main_~n~0] {347#true} is VALID [2022-04-07 23:30:54,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#true} [61] L23-->L26-2: Formula: (and (<= 0 v_main_~x~0_8) (< v_main_~y~0_6 v_main_~n~0_5) (<= v_main_~x~0_8 v_main_~y~0_6)) InVars {main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {352#(<= main_~x~0 main_~y~0)} is VALID [2022-04-07 23:30:54,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(<= main_~x~0 main_~y~0)} [65] L26-2-->L26: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {353#(<= main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-07 23:30:54,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(<= main_~x~0 (+ main_~y~0 1))} [67] L26-->L26-2: Formula: (and (< v_main_~y~0_3 v_main_~x~0_5) (= v_main_~y~0_2 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-07 23:30:54,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} [65] L26-2-->L26: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {355#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} is VALID [2022-04-07 23:30:54,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(and (<= (+ main_~y~0 1) main_~n~0) (<= main_~x~0 (+ main_~y~0 1)))} [67] L26-->L26-2: Formula: (and (< v_main_~y~0_3 v_main_~x~0_5) (= v_main_~y~0_2 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {394#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} is VALID [2022-04-07 23:30:54,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0))} [64] L26-2-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 23:30:54,157 INFO L272 TraceCheckUtils]: 12: Hoare triple {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} [66] L24-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~y~0_8) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {401#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:30:54,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {401#(<= 1 |__VERIFIER_assert_#in~cond|)} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {405#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:30:54,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#(<= 1 __VERIFIER_assert_~cond)} [71] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-07 23:30:54,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} [73] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-07 23:30:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:30:54,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:30:54,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} [73] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-07 23:30:54,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {405#(<= 1 __VERIFIER_assert_~cond)} [71] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {348#false} is VALID [2022-04-07 23:30:54,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {401#(<= 1 |__VERIFIER_assert_#in~cond|)} [70] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {405#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:30:54,395 INFO L272 TraceCheckUtils]: 12: Hoare triple {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} [66] L24-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~n~0_7 v_main_~y~0_8) 1 0)) InVars {main_~y~0=v_main_~y~0_8, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0, main_~n~0] {401#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:30:54,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} [64] L26-2-->L24-2: Formula: (not (< v_main_~x~0_1 v_main_~n~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {357#(and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0))} is VALID [2022-04-07 23:30:54,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} [67] L26-->L26-2: Formula: (and (< v_main_~y~0_3 v_main_~x~0_5) (= v_main_~y~0_2 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {424#(or (and (< main_~y~0 (+ main_~n~0 1)) (<= main_~n~0 main_~y~0)) (< main_~x~0 main_~n~0))} is VALID [2022-04-07 23:30:54,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} [65] L26-2-->L26: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {428#(or (< main_~x~0 main_~n~0) (and (< main_~y~0 main_~n~0) (<= main_~n~0 (+ main_~y~0 1))))} is VALID [2022-04-07 23:30:54,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(<= main_~x~0 (+ main_~y~0 1))} [67] L26-->L26-2: Formula: (and (< v_main_~y~0_3 v_main_~x~0_5) (= v_main_~y~0_2 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_#t~post5, main_~y~0] {354#(and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-07 23:30:54,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(<= main_~x~0 main_~y~0)} [65] L26-2-->L26: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~n~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~n~0=v_main_~n~0_2, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {353#(<= main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-07 23:30:54,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#true} [61] L23-->L26-2: Formula: (and (<= 0 v_main_~x~0_8) (< v_main_~y~0_6 v_main_~n~0_5) (<= v_main_~x~0_8 v_main_~y~0_6)) InVars {main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~n~0=v_main_~n~0_5, main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {352#(<= main_~x~0 main_~y~0)} is VALID [2022-04-07 23:30:54,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} [58] mainENTRY-->L23: Formula: (and (= v_main_~n~0_3 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~y~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_3, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~y~0, main_~n~0] {347#true} is VALID [2022-04-07 23:30:54,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} [55] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:54,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:54,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} [59] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:54,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} [56] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {347#true} is VALID [2022-04-07 23:30:54,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} [54] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {347#true} is VALID [2022-04-07 23:30:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:30:54,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015039154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 23:30:54,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 23:30:54,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-07 23:30:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649768325] [2022-04-07 23:30:54,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 23:30:54,404 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 23:30:54,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:30:54,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:30:54,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:30:54,419 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 23:30:54,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:30:54,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 23:30:54,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-07 23:30:54,421 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:30:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:54,647 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-07 23:30:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 23:30:54,647 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 23:30:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:30:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:30:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-07 23:30:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:30:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2022-04-07 23:30:54,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2022-04-07 23:30:54,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:30:54,666 INFO L225 Difference]: With dead ends: 21 [2022-04-07 23:30:54,666 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 23:30:54,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-04-07 23:30:54,667 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:30:54,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 45 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 23:30:54,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 23:30:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 23:30:54,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:30:54,668 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-07 23:30:54,668 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-07 23:30:54,668 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-07 23:30:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:54,668 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:30:54,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:30:54,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:54,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:54,669 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-07 23:30:54,669 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-07 23:30:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:30:54,669 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:30:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:30:54,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:54,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:30:54,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:30:54,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:30:54,669 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-07 23:30:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 23:30:54,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-07 23:30:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:30:54,670 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 23:30:54,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:30:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:30:54,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:30:54,672 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 23:30:54,691 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-07 23:30:54,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 23:30:54,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 23:30:54,927 INFO L878 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-07 23:30:54,927 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:30:54,927 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:30:54,927 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 23:30:54,927 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 23:30:54,928 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:30:54,928 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:30:54,928 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-07 23:30:54,928 INFO L882 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-04-07 23:30:54,929 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 30) no Hoare annotation was computed. [2022-04-07 23:30:54,929 INFO L878 garLoopResultBuilder]: At program point L26-2(lines 24 27) the Hoare annotation is: (let ((.cse0 (<= main_~x~0 main_~y~0))) (or (and .cse0 (<= main_~y~0 main_~n~0) (<= main_~y~0 main_~x~0)) (and (<= (+ main_~y~0 1) main_~n~0) .cse0))) [2022-04-07 23:30:54,929 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 30) no Hoare annotation was computed. [2022-04-07 23:30:54,929 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 27) the Hoare annotation is: (and (<= main_~x~0 main_~y~0) (<= main_~y~0 main_~n~0) (<= main_~n~0 main_~y~0)) [2022-04-07 23:30:54,929 INFO L882 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-07 23:30:54,929 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-07 23:30:54,929 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-07 23:30:54,929 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-07 23:30:54,929 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-07 23:30:54,929 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-07 23:30:54,929 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-07 23:30:54,929 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-07 23:30:54,932 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-07 23:30:54,933 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 23:30:54,935 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:30:54,935 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:30:54,936 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:30:54,936 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:30:54,936 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:30:54,936 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:30:54,936 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:30:54,936 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 23:30:54,936 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 23:30:54,936 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 23:30:54,938 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-07 23:30:54,938 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 23:30:54,938 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 23:30:54,938 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 23:30:54,938 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 23:30:54,938 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-07 23:30:54,939 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-07 23:30:54,939 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:30:54,939 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 23:30:54,939 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 23:30:54,939 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-07 23:30:54,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:30:54 BasicIcfg [2022-04-07 23:30:54,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 23:30:54,947 INFO L158 Benchmark]: Toolchain (without parser) took 3757.20ms. Allocated memory was 198.2MB in the beginning and 271.6MB in the end (delta: 73.4MB). Free memory was 146.9MB in the beginning and 113.5MB in the end (delta: 33.4MB). Peak memory consumption was 107.1MB. Max. memory is 8.0GB. [2022-04-07 23:30:54,947 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 23:30:54,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.22ms. Allocated memory is still 198.2MB. Free memory was 146.7MB in the beginning and 173.5MB in the end (delta: -26.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 23:30:54,947 INFO L158 Benchmark]: Boogie Preprocessor took 26.02ms. Allocated memory is still 198.2MB. Free memory was 173.5MB in the beginning and 171.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:30:54,948 INFO L158 Benchmark]: RCFGBuilder took 215.18ms. Allocated memory is still 198.2MB. Free memory was 171.9MB in the beginning and 160.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 23:30:54,948 INFO L158 Benchmark]: IcfgTransformer took 22.52ms. Allocated memory is still 198.2MB. Free memory was 160.3MB in the beginning and 158.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 23:30:54,948 INFO L158 Benchmark]: TraceAbstraction took 3282.90ms. Allocated memory was 198.2MB in the beginning and 271.6MB in the end (delta: 73.4MB). Free memory was 158.3MB in the beginning and 113.5MB in the end (delta: 44.8MB). Peak memory consumption was 119.3MB. Max. memory is 8.0GB. [2022-04-07 23:30:54,949 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 198.2MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.22ms. Allocated memory is still 198.2MB. Free memory was 146.7MB in the beginning and 173.5MB in the end (delta: -26.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.02ms. Allocated memory is still 198.2MB. Free memory was 173.5MB in the beginning and 171.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 215.18ms. Allocated memory is still 198.2MB. Free memory was 171.9MB in the beginning and 160.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 22.52ms. Allocated memory is still 198.2MB. Free memory was 160.3MB in the beginning and 158.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3282.90ms. Allocated memory was 198.2MB in the beginning and 271.6MB in the end (delta: 73.4MB). Free memory was 158.3MB in the beginning and 113.5MB in the end (delta: 44.8MB). Peak memory consumption was 119.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 39 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 15 NumberOfFragments, 41 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 47 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 383 SizeOfPredicates, 8 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 6/15 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: 24]: Loop Invariant Derived loop invariant: ((x <= y && y <= n) && y <= x) || (y + 1 <= n && x <= y) RESULT: Ultimate proved your program to be correct! [2022-04-07 23:30:54,973 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...