/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/cggmp2005.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:39:30,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:39:30,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:39:30,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:39:30,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:39:30,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:39:30,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:39:30,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:39:30,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:39:30,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:39:30,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:39:30,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:39:30,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:39:30,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:39:30,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:39:30,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:39:30,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:39:30,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:39:30,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:39:30,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:39:30,573 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:39:30,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:39:30,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:39:30,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:39:30,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:39:30,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:39:30,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:39:30,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:39:30,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:39:30,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:39:30,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:39:30,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:39:30,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:39:30,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:39:30,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:39:30,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:39:30,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:39:30,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:39:30,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:39:30,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:39:30,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:39:30,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:39:30,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:39:30,609 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:39:30,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:39:30,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:39:30,610 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:39:30,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:39:30,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:39:30,611 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:39:30,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:39:30,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:39:30,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:39:30,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:39:30,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:39:30,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:39:30,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:39:30,613 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:39:30,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:39:30,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:39:30,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:39:30,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:39:30,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:39:30,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:39:30,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:39:30,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:39:30,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:39:30,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:39:30,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:39:30,614 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:39:30,614 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:39:30,614 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:39:30,614 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:39:30,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:39:30,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:39:30,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:39:30,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:39:30,845 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:39:30,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005.i [2022-04-27 21:39:30,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4337130a1/6a2259e575cc4dd3aa756eb86c88b549/FLAGf5482ac5b [2022-04-27 21:39:31,219 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:39:31,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005.i [2022-04-27 21:39:31,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4337130a1/6a2259e575cc4dd3aa756eb86c88b549/FLAGf5482ac5b [2022-04-27 21:39:31,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4337130a1/6a2259e575cc4dd3aa756eb86c88b549 [2022-04-27 21:39:31,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:39:31,677 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:39:31,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:39:31,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:39:31,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:39:31,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:39:31" (1/1) ... [2022-04-27 21:39:31,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235c2f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:31, skipping insertion in model container [2022-04-27 21:39:31,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:39:31" (1/1) ... [2022-04-27 21:39:31,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:39:31,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:39:31,854 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/cggmp2005.i[895,908] [2022-04-27 21:39:31,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:39:31,882 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:39:31,892 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/cggmp2005.i[895,908] [2022-04-27 21:39:31,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:39:31,907 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:39:31,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:31 WrapperNode [2022-04-27 21:39:31,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:39:31,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:39:31,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:39:31,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:39:31,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:31" (1/1) ... [2022-04-27 21:39:31,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:31" (1/1) ... [2022-04-27 21:39:31,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:31" (1/1) ... [2022-04-27 21:39:31,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:31" (1/1) ... [2022-04-27 21:39:31,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:31" (1/1) ... [2022-04-27 21:39:31,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:31" (1/1) ... [2022-04-27 21:39:31,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:31" (1/1) ... [2022-04-27 21:39:31,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:39:31,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:39:31,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:39:31,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:39:31,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:31" (1/1) ... [2022-04-27 21:39:31,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:39:31,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:39:31,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:39:31,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:39:32,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:39:32,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:39:32,011 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:39:32,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:39:32,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:39:32,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:39:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:39:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:39:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:39:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:39:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:39:32,054 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:39:32,055 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:39:32,128 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:39:32,133 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:39:32,133 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:39:32,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:39:32 BoogieIcfgContainer [2022-04-27 21:39:32,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:39:32,135 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:39:32,135 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:39:32,136 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:39:32,138 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:39:32" (1/1) ... [2022-04-27 21:39:32,139 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:39:32,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:39:32 BasicIcfg [2022-04-27 21:39:32,150 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:39:32,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:39:32,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:39:32,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:39:32,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:39:31" (1/4) ... [2022-04-27 21:39:32,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b06ca6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:39:32, skipping insertion in model container [2022-04-27 21:39:32,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:31" (2/4) ... [2022-04-27 21:39:32,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b06ca6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:39:32, skipping insertion in model container [2022-04-27 21:39:32,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:39:32" (3/4) ... [2022-04-27 21:39:32,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b06ca6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:39:32, skipping insertion in model container [2022-04-27 21:39:32,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:39:32" (4/4) ... [2022-04-27 21:39:32,159 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005.iqvasr [2022-04-27 21:39:32,173 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:39:32,174 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:39:32,224 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:39:32,229 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c84f355, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3cb36957 [2022-04-27 21:39:32,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:39:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:39:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:39:32,240 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:32,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:32,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1257757292, now seen corresponding path program 1 times [2022-04-27 21:39:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:32,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957425050] [2022-04-27 21:39:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:32,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:32,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:32,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {22#true} is VALID [2022-04-27 21:39:32,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:39:32,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:39:32,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:32,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {22#true} is VALID [2022-04-27 21:39:32,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:39:32,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:39:32,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:39:32,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [57] mainENTRY-->L28-2: Formula: (and (= v_main_~j~0_5 10) (= v_main_~i~0_4 1)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {22#true} is VALID [2022-04-27 21:39:32,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} [59] L28-2-->L28-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 21:39:32,428 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} [62] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~j~0_8 6) 1 0)) InVars {main_~j~0=v_main_~j~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {23#false} is VALID [2022-04-27 21:39:32,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [64] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23#false} is VALID [2022-04-27 21:39:32,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} [66] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 21:39:32,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} [68] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 21:39:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:32,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:32,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957425050] [2022-04-27 21:39:32,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957425050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:39:32,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:39:32,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:39:32,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415236981] [2022-04-27 21:39:32,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:39:32,436 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-27 21:39:32,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:32,439 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-27 21:39:32,477 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-27 21:39:32,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:39:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:32,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:39:32,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:39:32,498 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.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-27 21:39:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:32,581 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-27 21:39:32,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:39:32,581 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-27 21:39:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:32,583 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-27 21:39:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 21:39:32,593 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-27 21:39:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 21:39:32,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-27 21:39:32,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:32,645 INFO L225 Difference]: With dead ends: 31 [2022-04-27 21:39:32,645 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 21:39:32,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:39:32,652 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:39:32,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 21 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:39:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 21:39:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 21:39:32,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:32,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:32,680 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:32,680 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:32,685 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 21:39:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 21:39:32,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:32,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:32,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 21:39:32,686 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 21:39:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:32,688 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 21:39:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 21:39:32,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:32,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:32,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:32,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 21:39:32,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 21:39:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:32,699 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 21:39:32,699 INFO L496 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-27 21:39:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 21:39:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:39:32,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:32,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:32,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:39:32,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:32,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1258680813, now seen corresponding path program 1 times [2022-04-27 21:39:32,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:32,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998588021] [2022-04-27 21:39:32,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:32,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:32,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:32,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {113#true} is VALID [2022-04-27 21:39:32,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 21:39:32,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {113#true} {113#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 21:39:32,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {113#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:32,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {113#true} is VALID [2022-04-27 21:39:32,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {113#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 21:39:32,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113#true} {113#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 21:39:32,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {113#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#true} is VALID [2022-04-27 21:39:32,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {113#true} [57] mainENTRY-->L28-2: Formula: (and (= v_main_~j~0_5 10) (= v_main_~i~0_4 1)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {118#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 21:39:32,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} [60] L28-2-->L28-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {114#false} is VALID [2022-04-27 21:39:32,806 INFO L272 TraceCheckUtils]: 7: Hoare triple {114#false} [62] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~j~0_8 6) 1 0)) InVars {main_~j~0=v_main_~j~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {114#false} is VALID [2022-04-27 21:39:32,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {114#false} [64] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {114#false} is VALID [2022-04-27 21:39:32,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {114#false} [66] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {114#false} is VALID [2022-04-27 21:39:32,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {114#false} [68] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#false} is VALID [2022-04-27 21:39:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:32,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:32,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998588021] [2022-04-27 21:39:32,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998588021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:39:32,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:39:32,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:39:32,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562565595] [2022-04-27 21:39:32,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:39:32,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 21:39:32,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:32,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 21:39:32,821 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-27 21:39:32,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:39:32,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:32,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:39:32,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:39:32,825 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 21:39:32,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:32,889 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 21:39:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:39:32,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 21:39:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 21:39:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 21:39:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 21:39:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 21:39:32,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-27 21:39:32,912 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-27 21:39:32,915 INFO L225 Difference]: With dead ends: 18 [2022-04-27 21:39:32,915 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 21:39:32,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:39:32,917 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:39:32,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:39:32,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 21:39:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 21:39:32,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:32,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:32,923 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:32,923 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:32,924 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:39:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:39:32,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:32,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:32,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 21:39:32,925 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 21:39:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:32,926 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:39:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:39:32,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:32,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:32,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:32,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 21:39:32,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 21:39:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:32,928 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 21:39:32,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 21:39:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:39:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:39:32,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:32,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:32,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:39:32,929 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash 391120150, now seen corresponding path program 1 times [2022-04-27 21:39:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:32,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602735884] [2022-04-27 21:39:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:33,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:33,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {199#true} is VALID [2022-04-27 21:39:33,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {199#true} {199#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {199#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:33,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {199#true} is VALID [2022-04-27 21:39:33,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {199#true} {199#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {199#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {199#true} [57] mainENTRY-->L28-2: Formula: (and (= v_main_~j~0_5 10) (= v_main_~i~0_4 1)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {204#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 21:39:33,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {204#(and (<= 10 main_~j~0) (= (+ (- 1) main_~i~0) 0))} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {205#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2022-04-27 21:39:33,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {205#(<= (+ main_~i~0 6) main_~j~0)} [60] L28-2-->L28-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {200#false} is VALID [2022-04-27 21:39:33,020 INFO L272 TraceCheckUtils]: 8: Hoare triple {200#false} [62] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~j~0_8 6) 1 0)) InVars {main_~j~0=v_main_~j~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {200#false} is VALID [2022-04-27 21:39:33,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {200#false} [64] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {200#false} is VALID [2022-04-27 21:39:33,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {200#false} [66] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {200#false} is VALID [2022-04-27 21:39:33,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {200#false} [68] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {200#false} is VALID [2022-04-27 21:39:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:33,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:33,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602735884] [2022-04-27 21:39:33,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602735884] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:39:33,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785888643] [2022-04-27 21:39:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:33,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:39:33,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:39:33,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:39:33,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:39:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:33,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 21:39:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:33,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:39:33,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {199#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#true} [55] 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] {199#true} is VALID [2022-04-27 21:39:33,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {199#true} {199#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {199#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {199#true} [57] mainENTRY-->L28-2: Formula: (and (= v_main_~j~0_5 10) (= v_main_~i~0_4 1)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {225#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2022-04-27 21:39:33,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {225#(and (<= 10 main_~j~0) (<= main_~i~0 1))} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {229#(and (<= 9 main_~j~0) (<= main_~i~0 3))} is VALID [2022-04-27 21:39:33,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#(and (<= 9 main_~j~0) (<= main_~i~0 3))} [60] L28-2-->L28-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {200#false} is VALID [2022-04-27 21:39:33,187 INFO L272 TraceCheckUtils]: 8: Hoare triple {200#false} [62] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~j~0_8 6) 1 0)) InVars {main_~j~0=v_main_~j~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {200#false} is VALID [2022-04-27 21:39:33,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {200#false} [64] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {200#false} is VALID [2022-04-27 21:39:33,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {200#false} [66] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {200#false} is VALID [2022-04-27 21:39:33,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {200#false} [68] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {200#false} is VALID [2022-04-27 21:39:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:33,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:39:33,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {200#false} [68] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {200#false} is VALID [2022-04-27 21:39:33,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {200#false} [66] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {200#false} is VALID [2022-04-27 21:39:33,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {200#false} [64] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {200#false} is VALID [2022-04-27 21:39:33,264 INFO L272 TraceCheckUtils]: 8: Hoare triple {200#false} [62] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~j~0_8 6) 1 0)) InVars {main_~j~0=v_main_~j~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {200#false} is VALID [2022-04-27 21:39:33,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#(<= main_~i~0 main_~j~0)} [60] L28-2-->L28-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {200#false} is VALID [2022-04-27 21:39:33,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#(<= (+ main_~i~0 3) main_~j~0)} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {257#(<= main_~i~0 main_~j~0)} is VALID [2022-04-27 21:39:33,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {199#true} [57] mainENTRY-->L28-2: Formula: (and (= v_main_~j~0_5 10) (= v_main_~i~0_4 1)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {261#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2022-04-27 21:39:33,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {199#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {199#true} {199#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#true} [55] 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] {199#true} is VALID [2022-04-27 21:39:33,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {199#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#true} is VALID [2022-04-27 21:39:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:33,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785888643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:39:33,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:39:33,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-27 21:39:33,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121322272] [2022-04-27 21:39:33,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:39:33,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:39:33,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:33,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:33,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:33,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 21:39:33,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 21:39:33,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:39:33,281 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:33,366 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 21:39:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:39:33,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:39:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-27 21:39:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-27 21:39:33,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2022-04-27 21:39:33,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:33,385 INFO L225 Difference]: With dead ends: 21 [2022-04-27 21:39:33,386 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 21:39:33,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:39:33,386 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:39:33,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:39:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 21:39:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 21:39:33,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:33,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:33,392 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:33,392 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:33,392 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 21:39:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 21:39:33,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:33,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:33,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 21:39:33,393 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 21:39:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:33,394 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 21:39:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 21:39:33,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:33,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:33,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:33,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-27 21:39:33,395 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-27 21:39:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:33,395 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-27 21:39:33,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 21:39:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:39:33,396 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:33,396 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:33,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:39:33,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:39:33,615 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash 377877549, now seen corresponding path program 2 times [2022-04-27 21:39:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:33,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61294289] [2022-04-27 21:39:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:33,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:33,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {383#true} is VALID [2022-04-27 21:39:33,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {383#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:33,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {383#true} {383#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:33,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {383#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:33,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {383#true} is VALID [2022-04-27 21:39:33,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {383#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:33,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {383#true} {383#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:33,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {383#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:33,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {383#true} [57] mainENTRY-->L28-2: Formula: (and (= v_main_~j~0_5 10) (= v_main_~i~0_4 1)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {388#(and (<= main_~j~0 10) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 21:39:33,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {388#(and (<= main_~j~0 10) (= (+ (- 1) main_~i~0) 0))} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {389#(and (<= main_~j~0 9) (<= 3 main_~i~0))} is VALID [2022-04-27 21:39:33,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {389#(and (<= main_~j~0 9) (<= 3 main_~i~0))} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {390#(and (<= main_~j~0 8) (<= 5 main_~i~0))} is VALID [2022-04-27 21:39:33,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#(and (<= main_~j~0 8) (<= 5 main_~i~0))} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {391#(and (<= main_~j~0 7) (<= 7 main_~i~0))} is VALID [2022-04-27 21:39:33,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(and (<= main_~j~0 7) (<= 7 main_~i~0))} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-27 21:39:33,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} [60] L28-2-->L28-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-27 21:39:33,729 INFO L272 TraceCheckUtils]: 11: Hoare triple {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} [62] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~j~0_8 6) 1 0)) InVars {main_~j~0=v_main_~j~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {393#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:39:33,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {393#(not (= |__VERIFIER_assert_#in~cond| 0))} [64] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {394#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:39:33,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#(not (= __VERIFIER_assert_~cond 0))} [66] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {384#false} is VALID [2022-04-27 21:39:33,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {384#false} [68] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {384#false} is VALID [2022-04-27 21:39:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:33,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:33,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61294289] [2022-04-27 21:39:33,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61294289] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:39:33,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690045764] [2022-04-27 21:39:33,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:39:33,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:39:33,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:39:33,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:39:33,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 21:39:33,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:39:33,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:39:33,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 21:39:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:33,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:39:33,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {383#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:33,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {383#true} [55] 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] {383#true} is VALID [2022-04-27 21:39:33,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {383#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:33,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {383#true} {383#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:33,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {383#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:33,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {383#true} [57] mainENTRY-->L28-2: Formula: (and (= v_main_~j~0_5 10) (= v_main_~i~0_4 1)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {414#(= main_~j~0 10)} is VALID [2022-04-27 21:39:33,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {414#(= main_~j~0 10)} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {418#(= 10 (+ main_~j~0 1))} is VALID [2022-04-27 21:39:33,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(= 10 (+ main_~j~0 1))} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {422#(= main_~j~0 8)} is VALID [2022-04-27 21:39:33,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(= main_~j~0 8)} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {426#(= 7 main_~j~0)} is VALID [2022-04-27 21:39:33,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {426#(= 7 main_~j~0)} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-27 21:39:33,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} [60] L28-2-->L28-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-27 21:39:33,973 INFO L272 TraceCheckUtils]: 11: Hoare triple {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} [62] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~j~0_8 6) 1 0)) InVars {main_~j~0=v_main_~j~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {436#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:39:33,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#(<= 1 |__VERIFIER_assert_#in~cond|)} [64] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {440#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:39:33,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {440#(<= 1 __VERIFIER_assert_~cond)} [66] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {384#false} is VALID [2022-04-27 21:39:33,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {384#false} [68] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {384#false} is VALID [2022-04-27 21:39:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:33,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:39:34,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {384#false} [68] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {384#false} is VALID [2022-04-27 21:39:34,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {440#(<= 1 __VERIFIER_assert_~cond)} [66] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {384#false} is VALID [2022-04-27 21:39:34,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#(<= 1 |__VERIFIER_assert_#in~cond|)} [64] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {440#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:39:34,083 INFO L272 TraceCheckUtils]: 11: Hoare triple {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} [62] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~j~0_8 6) 1 0)) InVars {main_~j~0=v_main_~j~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {436#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:39:34,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} [60] L28-2-->L28-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-27 21:39:34,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {426#(= 7 main_~j~0)} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {392#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2022-04-27 21:39:34,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(= main_~j~0 8)} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {426#(= 7 main_~j~0)} is VALID [2022-04-27 21:39:34,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(= 10 (+ main_~j~0 1))} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {422#(= main_~j~0 8)} is VALID [2022-04-27 21:39:34,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {414#(= main_~j~0 10)} [61] L28-2-->L28-2: Formula: (and (<= v_main_~i~0_3 v_main_~j~0_3) (= v_main_~j~0_2 (+ (- 1) v_main_~j~0_3)) (= (+ v_main_~i~0_3 2) v_main_~i~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {418#(= 10 (+ main_~j~0 1))} is VALID [2022-04-27 21:39:34,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {383#true} [57] mainENTRY-->L28-2: Formula: (and (= v_main_~j~0_5 10) (= v_main_~i~0_4 1)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {414#(= main_~j~0 10)} is VALID [2022-04-27 21:39:34,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {383#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:34,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {383#true} {383#true} [71] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:34,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {383#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:34,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {383#true} [55] 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] {383#true} is VALID [2022-04-27 21:39:34,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {383#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#true} is VALID [2022-04-27 21:39:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:34,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690045764] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:39:34,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:39:34,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-04-27 21:39:34,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398088013] [2022-04-27 21:39:34,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:39:34,087 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:39:34,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:34,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:34,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:34,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 21:39:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 21:39:34,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-04-27 21:39:34,104 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:34,370 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 21:39:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:39:34,371 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 21:39:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-27 21:39:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-27 21:39:34,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 21 transitions. [2022-04-27 21:39:34,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:34,389 INFO L225 Difference]: With dead ends: 20 [2022-04-27 21:39:34,390 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:39:34,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-04-27 21:39:34,391 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:39:34,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:39:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:39:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:39:34,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:34,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:34,392 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:34,392 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:34,392 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:39:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:39:34,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:34,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:34,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:39:34,392 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:39:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:34,392 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:39:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:39:34,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:34,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:34,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:34,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:39:34,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-27 21:39:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:34,393 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:39:34,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 13 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:39:34,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:34,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:39:34,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:39:34,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 21:39:34,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:39:34,679 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:39:34,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:39:34,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:39:34,679 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:39:34,679 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:39:34,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:39:34,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:39:34,679 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 34) the Hoare annotation is: true [2022-04-27 21:39:34,679 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 31) the Hoare annotation is: (let ((.cse0 (<= 7 main_~i~0))) (or (and (<= (+ main_~i~0 3) main_~j~0) (<= 5 main_~i~0) (= main_~j~0 8)) (and (<= main_~j~0 6) (< 5 main_~j~0) .cse0) (and (= main_~i~0 1) (= main_~j~0 10)) (and (<= main_~i~0 main_~j~0) (= 7 main_~j~0) .cse0) (and (= main_~j~0 9) (<= 3 main_~i~0) (<= main_~i~0 3)))) [2022-04-27 21:39:34,679 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 31) the Hoare annotation is: (and (<= main_~j~0 6) (< 5 main_~j~0) (<= 7 main_~i~0)) [2022-04-27 21:39:34,680 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-27 21:39:34,680 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 34) no Hoare annotation was computed. [2022-04-27 21:39:34,680 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 34) no Hoare annotation was computed. [2022-04-27 21:39:34,680 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:39:34,680 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:39:34,680 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:39:34,680 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:39:34,680 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:39:34,680 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:39:34,684 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 21:39:34,686 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:39:34,688 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:39:34,689 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:39:34,689 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:39:34,696 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:39:34,696 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:39:34,696 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:39:34,697 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:39:34,697 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:39:34,697 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:39:34,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:39:34,697 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 21:39:34,697 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:39:34,697 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:39:34,697 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:39:34,697 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-27 21:39:34,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:39:34 BasicIcfg [2022-04-27 21:39:34,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:39:34,706 INFO L158 Benchmark]: Toolchain (without parser) took 3028.73ms. Allocated memory was 178.3MB in the beginning and 221.2MB in the end (delta: 43.0MB). Free memory was 119.3MB in the beginning and 188.9MB in the end (delta: -69.6MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB. [2022-04-27 21:39:34,706 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:39:34,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.76ms. Allocated memory was 178.3MB in the beginning and 221.2MB in the end (delta: 43.0MB). Free memory was 119.1MB in the beginning and 192.7MB in the end (delta: -73.6MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-27 21:39:34,706 INFO L158 Benchmark]: Boogie Preprocessor took 34.29ms. Allocated memory is still 221.2MB. Free memory was 192.7MB in the beginning and 191.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:39:34,706 INFO L158 Benchmark]: RCFGBuilder took 189.06ms. Allocated memory is still 221.2MB. Free memory was 191.2MB in the beginning and 180.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 21:39:34,707 INFO L158 Benchmark]: IcfgTransformer took 15.47ms. Allocated memory is still 221.2MB. Free memory was 180.7MB in the beginning and 179.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:39:34,707 INFO L158 Benchmark]: TraceAbstraction took 2552.58ms. Allocated memory is still 221.2MB. Free memory was 179.2MB in the beginning and 188.9MB in the end (delta: -9.7MB). Peak memory consumption was 98.3MB. Max. memory is 8.0GB. [2022-04-27 21:39:34,708 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 178.3MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.76ms. Allocated memory was 178.3MB in the beginning and 221.2MB in the end (delta: 43.0MB). Free memory was 119.1MB in the beginning and 192.7MB in the end (delta: -73.6MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.29ms. Allocated memory is still 221.2MB. Free memory was 192.7MB in the beginning and 191.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 189.06ms. Allocated memory is still 221.2MB. Free memory was 191.2MB in the beginning and 180.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 15.47ms. Allocated memory is still 221.2MB. Free memory was 180.7MB in the beginning and 179.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2552.58ms. Allocated memory is still 221.2MB. Free memory was 179.2MB in the beginning and 188.9MB in the end (delta: -9.7MB). Peak memory consumption was 98.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 47 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 17 NumberOfFragments, 71 HoareAnnotationTreeSize, 11 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 3 NumberOfNonLiveVariables, 123 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 3/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((i + 3 <= j && 5 <= i) && j == 8) || ((j <= 6 && 5 < j) && 7 <= i)) || (i == 1 && j == 10)) || ((i <= j && 7 == j) && 7 <= i)) || ((j == 9 && 3 <= i) && i <= 3) RESULT: Ultimate proved your program to be correct! [2022-04-27 21:39:34,735 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...