/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:39:46,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:39:46,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:39:46,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:39:46,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:39:46,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:39:46,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:39:46,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:39:46,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:39:46,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:39:46,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:39:46,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:39:46,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:39:46,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:39:46,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:39:46,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:39:46,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:39:46,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:39:46,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:39:46,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:39:46,641 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:39:46,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:39:46,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:39:46,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:39:46,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:39:46,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:39:46,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:39:46,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:39:46,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:39:46,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:39:46,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:39:46,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:39:46,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:39:46,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:39:46,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:39:46,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:39:46,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:39:46,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:39:46,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:39:46,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:39:46,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:39:46,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:39:46,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:39:46,681 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:39:46,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:39:46,683 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:39:46,683 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:39:46,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:39:46,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:39:46,684 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:39:46,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:39:46,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:39:46,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:39:46,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:39:46,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:39:46,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:39:46,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:39:46,685 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:39:46,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:39:46,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:39:46,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:39:46,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:39:46,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:39:46,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:39:46,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:39:46,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:39:46,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:39:46,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:39:46,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:39:46,686 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:39:46,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:39:46,689 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:39:46,689 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-15 00:39:46,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:39:46,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:39:46,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:39:46,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:39:46,888 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:39:46,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-15 00:39:46,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e22488c/489f7660fde8440b9ebc4e83b19b7be7/FLAG4d8e12145 [2022-04-15 00:39:47,271 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:39:47,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-15 00:39:47,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e22488c/489f7660fde8440b9ebc4e83b19b7be7/FLAG4d8e12145 [2022-04-15 00:39:47,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e22488c/489f7660fde8440b9ebc4e83b19b7be7 [2022-04-15 00:39:47,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:39:47,288 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:39:47,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:39:47,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:39:47,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:39:47,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:39:47" (1/1) ... [2022-04-15 00:39:47,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5feb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:47, skipping insertion in model container [2022-04-15 00:39:47,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:39:47" (1/1) ... [2022-04-15 00:39:47,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:39:47,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:39:47,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i[895,908] [2022-04-15 00:39:47,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:39:47,508 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:39:47,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i[895,908] [2022-04-15 00:39:47,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:39:47,538 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:39:47,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:47 WrapperNode [2022-04-15 00:39:47,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:39:47,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:39:47,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:39:47,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:39:47,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:47" (1/1) ... [2022-04-15 00:39:47,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:47" (1/1) ... [2022-04-15 00:39:47,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:47" (1/1) ... [2022-04-15 00:39:47,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:47" (1/1) ... [2022-04-15 00:39:47,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:47" (1/1) ... [2022-04-15 00:39:47,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:47" (1/1) ... [2022-04-15 00:39:47,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:47" (1/1) ... [2022-04-15 00:39:47,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:39:47,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:39:47,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:39:47,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:39:47,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:47" (1/1) ... [2022-04-15 00:39:47,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:39:47,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:39:47,596 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-15 00:39:47,610 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-15 00:39:47,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:39:47,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:39:47,621 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:39:47,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:39:47,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:39:47,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:39:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:39:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:39:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:39:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:39:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:39:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:39:47,621 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:39:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:39:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:39:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:39:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:39:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:39:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:39:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:39:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:39:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:39:47,670 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:39:47,671 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:39:47,761 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:39:47,765 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:39:47,765 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:39:47,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:39:47 BoogieIcfgContainer [2022-04-15 00:39:47,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:39:47,767 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:39:47,767 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:39:47,768 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:39:47,770 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:39:47" (1/1) ... [2022-04-15 00:39:47,771 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:39:47,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:39:47 BasicIcfg [2022-04-15 00:39:47,787 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:39:47,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:39:47,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:39:47,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:39:47,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:39:47" (1/4) ... [2022-04-15 00:39:47,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d482cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:39:47, skipping insertion in model container [2022-04-15 00:39:47,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:47" (2/4) ... [2022-04-15 00:39:47,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d482cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:39:47, skipping insertion in model container [2022-04-15 00:39:47,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:39:47" (3/4) ... [2022-04-15 00:39:47,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d482cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:39:47, skipping insertion in model container [2022-04-15 00:39:47,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:39:47" (4/4) ... [2022-04-15 00:39:47,792 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007b.iqvasr [2022-04-15 00:39:47,795 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:39:47,795 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:39:47,857 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:39:47,861 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-15 00:39:47,861 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:39:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:39:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:39:47,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:39:47,877 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:39:47,877 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:39:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:39:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1113749397, now seen corresponding path program 1 times [2022-04-15 00:39:47,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:39:47,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438604373] [2022-04-15 00:39:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:39:47,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:39:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:48,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:39:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:48,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-15 00:39:48,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:39:48,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:39:48,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [63] 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-15 00:39:48,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-15 00:39:48,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:39:48,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:39:48,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:39:48,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {25#true} is VALID [2022-04-15 00:39:48,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [69] L28-2-->L28-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:39:48,056 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {26#false} is VALID [2022-04-15 00:39:48,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-15 00:39:48,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:39:48,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:39:48,057 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-15 00:39:48,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:39:48,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438604373] [2022-04-15 00:39:48,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438604373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:39:48,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:39:48,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:39:48,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855219313] [2022-04-15 00:39:48,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:39:48,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 00:39:48,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:39:48,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 00:39:48,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:48,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:39:48,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:39:48,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:39:48,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:39:48,114 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 00:39:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:48,192 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 00:39:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:39:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 00:39:48,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:39:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 00:39:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 00:39:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 00:39:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 00:39:48,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-15 00:39:48,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:48,270 INFO L225 Difference]: With dead ends: 35 [2022-04-15 00:39:48,270 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 00:39:48,273 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:39:48,276 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:39:48,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:39:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 00:39:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 00:39:48,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:39:48,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:48,314 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:48,314 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:48,316 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 00:39:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 00:39:48,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:48,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:48,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-15 00:39:48,317 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-15 00:39:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:48,319 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 00:39:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 00:39:48,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:48,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:48,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:39:48,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:39:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 00:39:48,322 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 00:39:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:39:48,322 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 00:39:48,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 00:39:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 00:39:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:39:48,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:39:48,323 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:39:48,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:39:48,323 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:39:48,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:39:48,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1114672918, now seen corresponding path program 1 times [2022-04-15 00:39:48,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:39:48,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903107488] [2022-04-15 00:39:48,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:39:48,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:39:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:48,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:39:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:48,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {138#true} is VALID [2022-04-15 00:39:48,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-15 00:39:48,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-15 00:39:48,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {138#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:39:48,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {138#true} is VALID [2022-04-15 00:39:48,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-15 00:39:48,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138#true} {138#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-15 00:39:48,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {138#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-15 00:39:48,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {143#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-15 00:39:48,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {143#(or (<= 0 main_~m~0) (<= main_~n~0 0))} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {143#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-15 00:39:48,457 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#(or (<= 0 main_~m~0) (<= main_~n~0 0))} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {144#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:39:48,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {144#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {145#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:39:48,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {145#(not (= __VERIFIER_assert_~cond 0))} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-15 00:39:48,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {139#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-15 00:39:48,459 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-15 00:39:48,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:39:48,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903107488] [2022-04-15 00:39:48,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903107488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:39:48,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:39:48,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:39:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588228989] [2022-04-15 00:39:48,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:39:48,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 00:39:48,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:39:48,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-15 00:39:48,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:48,473 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:39:48,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:39:48,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:39:48,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:39:48,475 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-15 00:39:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:48,641 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 00:39:48,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:39:48,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 00:39:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:39:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-15 00:39:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-15 00:39:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-15 00:39:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-15 00:39:48,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-15 00:39:48,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:48,673 INFO L225 Difference]: With dead ends: 28 [2022-04-15 00:39:48,673 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 00:39:48,673 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:39:48,674 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:39:48,674 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:39:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 00:39:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 00:39:48,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:39:48,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:39:48,706 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:39:48,706 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:39:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:48,708 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 00:39:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 00:39:48,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:48,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:48,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 00:39:48,709 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 00:39:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:48,710 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 00:39:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 00:39:48,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:48,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:48,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:39:48,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:39:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:39:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-15 00:39:48,712 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2022-04-15 00:39:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:39:48,712 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-15 00:39:48,712 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-15 00:39:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 00:39:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:39:48,713 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:39:48,713 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:39:48,713 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:39:48,713 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:39:48,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:39:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1184176601, now seen corresponding path program 1 times [2022-04-15 00:39:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:39:48,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171288660] [2022-04-15 00:39:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:39:48,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:39:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:48,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:39:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:48,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {285#true} is VALID [2022-04-15 00:39:48,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:48,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {285#true} {285#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:48,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:39:48,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {285#true} is VALID [2022-04-15 00:39:48,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:48,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:48,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:48,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {290#(= main_~x~0 0)} is VALID [2022-04-15 00:39:48,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#(= main_~x~0 0)} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {290#(= main_~x~0 0)} is VALID [2022-04-15 00:39:48,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {290#(= main_~x~0 0)} [73] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_3| 0)) (= v_main_~m~0_3 v_main_~x~0_3)) InVars {main_~x~0=v_main_~x~0_3, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~m~0=v_main_~m~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~m~0, main_#t~nondet2] {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-15 00:39:48,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-15 00:39:48,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-15 00:39:48,792 INFO L272 TraceCheckUtils]: 10: Hoare triple {291#(or (<= 0 main_~m~0) (<= main_~n~0 0))} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {292#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:39:48,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {293#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:39:48,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(not (= __VERIFIER_assert_~cond 0))} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {286#false} is VALID [2022-04-15 00:39:48,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {286#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#false} is VALID [2022-04-15 00:39:48,795 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-15 00:39:48,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:39:48,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171288660] [2022-04-15 00:39:48,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171288660] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:39:48,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510156295] [2022-04-15 00:39:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:39:48,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:39:48,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:39:48,798 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-15 00:39:48,799 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-15 00:39:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:48,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 00:39:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:48,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:39:49,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:49,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {285#true} is VALID [2022-04-15 00:39:49,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:49,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:49,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:49,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {313#(<= 0 main_~x~0)} is VALID [2022-04-15 00:39:49,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(<= 0 main_~x~0)} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {313#(<= 0 main_~x~0)} is VALID [2022-04-15 00:39:49,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(<= 0 main_~x~0)} [73] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_3| 0)) (= v_main_~m~0_3 v_main_~x~0_3)) InVars {main_~x~0=v_main_~x~0_3, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~m~0=v_main_~m~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~m~0, main_#t~nondet2] {320#(<= 0 main_~m~0)} is VALID [2022-04-15 00:39:49,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= 0 main_~m~0)} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {320#(<= 0 main_~m~0)} is VALID [2022-04-15 00:39:49,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(<= 0 main_~m~0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {320#(<= 0 main_~m~0)} is VALID [2022-04-15 00:39:49,007 INFO L272 TraceCheckUtils]: 10: Hoare triple {320#(<= 0 main_~m~0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:39:49,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {330#(<= 1 |__VERIFIER_assert_#in~cond|)} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:39:49,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {334#(<= 1 __VERIFIER_assert_~cond)} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {286#false} is VALID [2022-04-15 00:39:49,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {286#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#false} is VALID [2022-04-15 00:39:49,008 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-15 00:39:49,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:39:49,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {286#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {286#false} is VALID [2022-04-15 00:39:49,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {334#(<= 1 __VERIFIER_assert_~cond)} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {286#false} is VALID [2022-04-15 00:39:49,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {330#(<= 1 |__VERIFIER_assert_#in~cond|)} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:39:49,111 INFO L272 TraceCheckUtils]: 10: Hoare triple {320#(<= 0 main_~m~0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:39:49,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(<= 0 main_~m~0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {320#(<= 0 main_~m~0)} is VALID [2022-04-15 00:39:49,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= 0 main_~m~0)} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {320#(<= 0 main_~m~0)} is VALID [2022-04-15 00:39:49,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(<= 0 main_~x~0)} [73] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_3| 0)) (= v_main_~m~0_3 v_main_~x~0_3)) InVars {main_~x~0=v_main_~x~0_3, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~m~0=v_main_~m~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~m~0, main_#t~nondet2] {320#(<= 0 main_~m~0)} is VALID [2022-04-15 00:39:49,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(<= 0 main_~x~0)} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {313#(<= 0 main_~x~0)} is VALID [2022-04-15 00:39:49,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {313#(<= 0 main_~x~0)} is VALID [2022-04-15 00:39:49,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:49,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:49,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:49,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {285#true} is VALID [2022-04-15 00:39:49,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#true} is VALID [2022-04-15 00:39:49,114 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-15 00:39:49,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510156295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:39:49,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:39:49,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-04-15 00:39:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584777359] [2022-04-15 00:39:49,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:39:49,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:39:49,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:39:49,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:39:49,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:49,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 00:39:49,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:39:49,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 00:39:49,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 00:39:49,132 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:39:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:49,369 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-15 00:39:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:39:49,370 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:39:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:39:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:39:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 00:39:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:39:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 00:39:49,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-15 00:39:49,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:49,396 INFO L225 Difference]: With dead ends: 37 [2022-04-15 00:39:49,396 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 00:39:49,397 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-15 00:39:49,397 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:39:49,398 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:39:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 00:39:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2022-04-15 00:39:49,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:39:49,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,406 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,406 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:49,408 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 00:39:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 00:39:49,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:49,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:49,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-15 00:39:49,408 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-15 00:39:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:49,410 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 00:39:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-15 00:39:49,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:49,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:49,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:39:49,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:39:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-15 00:39:49,411 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-15 00:39:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:39:49,412 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-15 00:39:49,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:39:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 00:39:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 00:39:49,412 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:39:49,412 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:39:49,432 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-15 00:39:49,629 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:39:49,630 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:39:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:39:49,630 INFO L85 PathProgramCache]: Analyzing trace with hash 727226116, now seen corresponding path program 1 times [2022-04-15 00:39:49,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:39:49,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052878719] [2022-04-15 00:39:49,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:39:49,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:39:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:49,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:39:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:49,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {538#true} is VALID [2022-04-15 00:39:49,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-15 00:39:49,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-15 00:39:49,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 00:39:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:49,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {538#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {538#true} is VALID [2022-04-15 00:39:49,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-15 00:39:49,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-15 00:39:49,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {544#(<= main_~n~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {544#(<= main_~n~0 0)} is VALID [2022-04-15 00:39:49,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:39:49,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {538#true} is VALID [2022-04-15 00:39:49,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-15 00:39:49,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-15 00:39:49,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-15 00:39:49,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {543#(= main_~x~0 0)} is VALID [2022-04-15 00:39:49,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#(= main_~x~0 0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {544#(<= main_~n~0 0)} is VALID [2022-04-15 00:39:49,694 INFO L272 TraceCheckUtils]: 7: Hoare triple {544#(<= main_~n~0 0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {538#true} is VALID [2022-04-15 00:39:49,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {538#true} is VALID [2022-04-15 00:39:49,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-15 00:39:49,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {538#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {538#true} is VALID [2022-04-15 00:39:49,695 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {538#true} {544#(<= main_~n~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {544#(<= main_~n~0 0)} is VALID [2022-04-15 00:39:49,696 INFO L272 TraceCheckUtils]: 12: Hoare triple {544#(<= main_~n~0 0)} [75] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (or (<= v_main_~n~0_7 0) (< v_main_~m~0_6 v_main_~n~0_7)) 1 0)) InVars {main_~m~0=v_main_~m~0_6, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {549#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:39:49,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {549#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {550#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:39:49,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {550#(not (= __VERIFIER_assert_~cond 0))} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {539#false} is VALID [2022-04-15 00:39:49,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {539#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {539#false} is VALID [2022-04-15 00:39:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:39:49,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:39:49,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052878719] [2022-04-15 00:39:49,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052878719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:39:49,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:39:49,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:39:49,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100557480] [2022-04-15 00:39:49,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:39:49,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-15 00:39:49,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:39:49,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:49,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:39:49,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:39:49,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:39:49,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:39:49,710 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:49,903 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 00:39:49,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:39:49,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-15 00:39:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:39:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 00:39:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 00:39:49,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-15 00:39:49,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:49,933 INFO L225 Difference]: With dead ends: 32 [2022-04-15 00:39:49,933 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 00:39:49,933 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:39:49,934 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:39:49,934 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:39:49,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 00:39:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-15 00:39:49,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:39:49,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,943 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,943 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:49,946 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 00:39:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 00:39:49,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:49,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:49,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 00:39:49,947 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 00:39:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:49,950 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 00:39:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 00:39:49,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:49,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:49,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:39:49,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:39:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-15 00:39:49,952 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2022-04-15 00:39:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:39:49,952 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-15 00:39:49,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 00:39:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 00:39:49,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:39:49,955 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:39:49,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 00:39:49,955 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:39:49,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:39:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash -415543775, now seen corresponding path program 1 times [2022-04-15 00:39:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:39:49,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647930356] [2022-04-15 00:39:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:39:49,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:39:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:50,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:39:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:50,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {685#true} is VALID [2022-04-15 00:39:50,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 00:39:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:50,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {685#true} is VALID [2022-04-15 00:39:50,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {691#(= main_~m~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {691#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:39:50,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {698#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {685#true} is VALID [2022-04-15 00:39:50,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {690#(= main_~x~0 0)} is VALID [2022-04-15 00:39:50,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {690#(= main_~x~0 0)} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {690#(= main_~x~0 0)} is VALID [2022-04-15 00:39:50,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {690#(= main_~x~0 0)} [73] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_3| 0)) (= v_main_~m~0_3 v_main_~x~0_3)) InVars {main_~x~0=v_main_~x~0_3, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~m~0=v_main_~m~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~m~0, main_#t~nondet2] {691#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {691#(= main_~m~0 0)} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {691#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {691#(= main_~m~0 0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {691#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,059 INFO L272 TraceCheckUtils]: 10: Hoare triple {691#(= main_~m~0 0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {685#true} is VALID [2022-04-15 00:39:50,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {685#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {685#true} is VALID [2022-04-15 00:39:50,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,060 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {685#true} {691#(= main_~m~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {691#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,061 INFO L272 TraceCheckUtils]: 15: Hoare triple {691#(= main_~m~0 0)} [75] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (or (<= v_main_~n~0_7 0) (< v_main_~m~0_6 v_main_~n~0_7)) 1 0)) InVars {main_~m~0=v_main_~m~0_6, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {696#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:39:50,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {696#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {697#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:39:50,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {697#(not (= __VERIFIER_assert_~cond 0))} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {686#false} is VALID [2022-04-15 00:39:50,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {686#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {686#false} is VALID [2022-04-15 00:39:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:39:50,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:39:50,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647930356] [2022-04-15 00:39:50,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647930356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:39:50,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339251273] [2022-04-15 00:39:50,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:39:50,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:39:50,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:39:50,096 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-15 00:39:50,130 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-15 00:39:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:50,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 00:39:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:50,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:39:50,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {685#true} is VALID [2022-04-15 00:39:50,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {685#true} is VALID [2022-04-15 00:39:50,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {685#true} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {720#(< main_~x~0 main_~n~0)} is VALID [2022-04-15 00:39:50,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {720#(< main_~x~0 main_~n~0)} [73] L29-->L29-2: Formula: (and (not (= |v_main_#t~nondet2_3| 0)) (= v_main_~m~0_3 v_main_~x~0_3)) InVars {main_~x~0=v_main_~x~0_3, main_#t~nondet2=|v_main_#t~nondet2_3|} OutVars{main_~m~0=v_main_~m~0_3, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~m~0, main_#t~nondet2] {724#(< main_~m~0 main_~n~0)} is VALID [2022-04-15 00:39:50,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#(< main_~m~0 main_~n~0)} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {724#(< main_~m~0 main_~n~0)} is VALID [2022-04-15 00:39:50,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#(< main_~m~0 main_~n~0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {724#(< main_~m~0 main_~n~0)} is VALID [2022-04-15 00:39:50,293 INFO L272 TraceCheckUtils]: 10: Hoare triple {724#(< main_~m~0 main_~n~0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {685#true} is VALID [2022-04-15 00:39:50,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {685#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {685#true} is VALID [2022-04-15 00:39:50,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#true} is VALID [2022-04-15 00:39:50,294 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {685#true} {724#(< main_~m~0 main_~n~0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {724#(< main_~m~0 main_~n~0)} is VALID [2022-04-15 00:39:50,294 INFO L272 TraceCheckUtils]: 15: Hoare triple {724#(< main_~m~0 main_~n~0)} [75] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (or (<= v_main_~n~0_7 0) (< v_main_~m~0_6 v_main_~n~0_7)) 1 0)) InVars {main_~m~0=v_main_~m~0_6, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {749#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:39:50,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {749#(<= 1 |__VERIFIER_assert_#in~cond|)} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:39:50,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {753#(<= 1 __VERIFIER_assert_~cond)} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {686#false} is VALID [2022-04-15 00:39:50,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {686#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {686#false} is VALID [2022-04-15 00:39:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:39:50,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 00:39:50,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339251273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:39:50,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 00:39:50,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-04-15 00:39:50,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247245560] [2022-04-15 00:39:50,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:39:50,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-15 00:39:50,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:39:50,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:50,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:39:50,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:39:50,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:39:50,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-15 00:39:50,320 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:50,431 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 00:39:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:39:50,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-15 00:39:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:39:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-15 00:39:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-15 00:39:50,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-04-15 00:39:50,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:50,454 INFO L225 Difference]: With dead ends: 29 [2022-04-15 00:39:50,454 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 00:39:50,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-15 00:39:50,455 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:39:50,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:39:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 00:39:50,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 00:39:50,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:39:50,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,466 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,466 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:50,467 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 00:39:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 00:39:50,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:50,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:50,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-15 00:39:50,467 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-15 00:39:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:50,468 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 00:39:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 00:39:50,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:50,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:50,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:39:50,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:39:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 00:39:50,470 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2022-04-15 00:39:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:39:50,471 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 00:39:50,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 00:39:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 00:39:50,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:39:50,471 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:39:50,488 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-15 00:39:50,688 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:39:50,688 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:39:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:39:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash -286461056, now seen corresponding path program 1 times [2022-04-15 00:39:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:39:50,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693173457] [2022-04-15 00:39:50,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:39:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:39:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:50,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:39:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:50,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {876#true} is VALID [2022-04-15 00:39:50,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {876#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {876#true} is VALID [2022-04-15 00:39:50,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {876#true} {876#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {876#true} is VALID [2022-04-15 00:39:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 00:39:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:39:50,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {876#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {876#true} is VALID [2022-04-15 00:39:50,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {876#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {876#true} is VALID [2022-04-15 00:39:50,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {876#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {876#true} is VALID [2022-04-15 00:39:50,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {876#true} {881#(= main_~m~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {881#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {876#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:39:50,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {888#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {876#true} is VALID [2022-04-15 00:39:50,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {876#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {876#true} is VALID [2022-04-15 00:39:50,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {876#true} {876#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {876#true} is VALID [2022-04-15 00:39:50,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {876#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {876#true} is VALID [2022-04-15 00:39:50,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {876#true} [67] mainENTRY-->L28-2: Formula: (and (= v_main_~n~0_5 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~x~0_4 0) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~m~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~n~0=v_main_~n~0_5, main_~m~0=v_main_~m~0_4, main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~m~0, main_~x~0, main_#t~nondet1, main_~n~0] {881#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#(= main_~m~0 0)} [71] L28-2-->L29: Formula: (and (<= 0 (+ |v_main_#t~nondet2_1| 2147483648)) (< v_main_~x~0_2 v_main_~n~0_4) (<= |v_main_#t~nondet2_1| 2147483647)) InVars {main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} OutVars{main_~n~0=v_main_~n~0_4, main_~x~0=v_main_~x~0_2, main_#t~nondet2=|v_main_#t~nondet2_1|} AuxVars[] AssignedVars[] {881#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {881#(= main_~m~0 0)} [74] L29-->L29-2: Formula: (= |v_main_#t~nondet2_5| 0) InVars {main_#t~nondet2=|v_main_#t~nondet2_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet2] {881#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {881#(= main_~m~0 0)} [77] L29-2-->L28-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[main_~x~0] {881#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {881#(= main_~m~0 0)} [70] L28-2-->L28-3: Formula: (not (< v_main_~x~0_1 v_main_~n~0_3)) InVars {main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} OutVars{main_~x~0=v_main_~x~0_1, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {881#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,738 INFO L272 TraceCheckUtils]: 10: Hoare triple {881#(= main_~m~0 0)} [72] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {876#true} is VALID [2022-04-15 00:39:50,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {876#true} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {876#true} is VALID [2022-04-15 00:39:50,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {876#true} [80] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {876#true} is VALID [2022-04-15 00:39:50,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {876#true} [84] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {876#true} is VALID [2022-04-15 00:39:50,739 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {876#true} {881#(= main_~m~0 0)} [87] __VERIFIER_assertEXIT-->L34: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (or (<= v_main_~n~0_6 0) (<= 0 v_main_~m~0_5)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~m~0=v_main_~m~0_5, main_~n~0=v_main_~n~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {881#(= main_~m~0 0)} is VALID [2022-04-15 00:39:50,740 INFO L272 TraceCheckUtils]: 15: Hoare triple {881#(= main_~m~0 0)} [75] L34-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (or (<= v_main_~n~0_7 0) (< v_main_~m~0_6 v_main_~n~0_7)) 1 0)) InVars {main_~m~0=v_main_~m~0_6, main_~n~0=v_main_~n~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~m~0, main_~n~0] {886#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:39:50,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {886#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {887#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:39:50,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {887#(not (= __VERIFIER_assert_~cond 0))} [79] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {877#false} is VALID [2022-04-15 00:39:50,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#false} is VALID [2022-04-15 00:39:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 00:39:50,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:39:50,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693173457] [2022-04-15 00:39:50,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693173457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:39:50,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:39:50,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:39:50,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692800311] [2022-04-15 00:39:50,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:39:50,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-15 00:39:50,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:39:50,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:50,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:39:50,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:39:50,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:39:50,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:39:50,754 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:50,824 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 00:39:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:39:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-15 00:39:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:39:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-15 00:39:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-15 00:39:50,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-15 00:39:50,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:39:50,840 INFO L225 Difference]: With dead ends: 20 [2022-04-15 00:39:50,840 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:39:50,840 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:39:50,841 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:39:50,841 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:39:50,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:39:50,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:39:50,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:39:50,842 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-15 00:39:50,842 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-15 00:39:50,842 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-15 00:39:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:50,842 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:39:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:39:50,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:50,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:50,842 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-15 00:39:50,843 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-15 00:39:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:39:50,843 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:39:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:39:50,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:50,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:39:50,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:39:50,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:39:50,843 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-15 00:39:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:39:50,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-04-15 00:39:50,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:39:50,843 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:39:50,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:39:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:39:50,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:39:50,846 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:39:50,846 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 00:39:50,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:39:51,039 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-15 00:39:51,039 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:39:51,039 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:39:51,039 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:39:51,039 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:39:51,039 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:39:51,039 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:39:51,040 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 37) the Hoare annotation is: true [2022-04-15 00:39:51,040 INFO L878 garLoopResultBuilder]: At program point L28-2(lines 28 33) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0)) (.cse1 (<= 0 main_~x~0))) (or (and .cse0 .cse1 (= main_~m~0 0)) (and .cse0 (< main_~m~0 main_~n~0) .cse1))) [2022-04-15 00:39:51,040 INFO L878 garLoopResultBuilder]: At program point L28-3(lines 28 33) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0)) (.cse1 (<= 0 main_~x~0))) (or (and .cse0 .cse1 (= main_~m~0 0)) (and .cse0 (< main_~m~0 main_~n~0) .cse1) (and (= main_~x~0 0) .cse0 .cse1 (<= main_~n~0 0)))) [2022-04-15 00:39:51,040 INFO L882 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2022-04-15 00:39:51,040 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0)) (.cse1 (<= 0 main_~x~0))) (or (and .cse0 .cse1 (= main_~m~0 0)) (and .cse0 (< main_~m~0 main_~n~0) .cse1) (and (= main_~x~0 0) .cse0 .cse1 (<= main_~n~0 0)))) [2022-04-15 00:39:51,040 INFO L882 garLoopResultBuilder]: For program point L29-2(lines 29 31) no Hoare annotation was computed. [2022-04-15 00:39:51,040 INFO L882 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-15 00:39:51,040 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 37) no Hoare annotation was computed. [2022-04-15 00:39:51,040 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 37) no Hoare annotation was computed. [2022-04-15 00:39:51,040 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 00:39:51,040 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-15 00:39:51,040 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-15 00:39:51,040 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:39:51,040 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-15 00:39:51,040 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:39:51,043 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-15 00:39:51,043 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:39:51,046 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:39:51,047 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:39:51,047 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:39:51,049 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:39:51,049 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:39:51,049 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:39:51,049 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:39:51,049 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:39:51,049 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:39:51,049 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:39:51,049 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:39:51,049 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-15 00:39:51,049 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-15 00:39:51,049 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:39:51,050 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:39:51,050 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 00:39:51,050 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:39:51,050 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:39:51,050 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:39:51,050 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:39:51,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:39:51 BasicIcfg [2022-04-15 00:39:51,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:39:51,058 INFO L158 Benchmark]: Toolchain (without parser) took 3769.98ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 151.6MB in the beginning and 157.2MB in the end (delta: -5.6MB). Peak memory consumption was 147.7MB. Max. memory is 8.0GB. [2022-04-15 00:39:51,058 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:39:51,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.55ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 151.4MB in the beginning and 333.8MB in the end (delta: -182.5MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. [2022-04-15 00:39:51,058 INFO L158 Benchmark]: Boogie Preprocessor took 29.73ms. Allocated memory is still 362.8MB. Free memory was 333.8MB in the beginning and 332.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:39:51,058 INFO L158 Benchmark]: RCFGBuilder took 195.62ms. Allocated memory is still 362.8MB. Free memory was 332.2MB in the beginning and 320.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:39:51,059 INFO L158 Benchmark]: IcfgTransformer took 19.67ms. Allocated memory is still 362.8MB. Free memory was 320.9MB in the beginning and 319.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:39:51,059 INFO L158 Benchmark]: TraceAbstraction took 3268.88ms. Allocated memory is still 362.8MB. Free memory was 318.8MB in the beginning and 157.2MB in the end (delta: 161.7MB). Peak memory consumption was 161.4MB. Max. memory is 8.0GB. [2022-04-15 00:39:51,060 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 209.7MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.55ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 151.4MB in the beginning and 333.8MB in the end (delta: -182.5MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.73ms. Allocated memory is still 362.8MB. Free memory was 333.8MB in the beginning and 332.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 195.62ms. Allocated memory is still 362.8MB. Free memory was 332.2MB in the beginning and 320.9MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.67ms. Allocated memory is still 362.8MB. Free memory was 320.9MB in the beginning and 319.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3268.88ms. Allocated memory is still 362.8MB. Free memory was 318.8MB in the beginning and 157.2MB in the end (delta: 161.7MB). Peak memory consumption was 161.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 93 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 23 NumberOfFragments, 100 HoareAnnotationTreeSize, 15 FomulaSimplifications, 236 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 131 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 5 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((0 <= m && 0 <= x) && m == 0) || ((0 <= m && m < n) && 0 <= x) RESULT: Ultimate proved your program to be correct! [2022-04-15 00:39:51,099 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...