/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-invgen/nested9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:32:04,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:32:04,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:32:04,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:32:04,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:32:04,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:32:04,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:32:04,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:32:04,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:32:04,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:32:04,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:32:04,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:32:04,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:32:04,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:32:04,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:32:04,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:32:04,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:32:04,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:32:04,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:32:04,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:32:04,134 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:32:04,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:32:04,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:32:04,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:32:04,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:32:04,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:32:04,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:32:04,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:32:04,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:32:04,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:32:04,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:32:04,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:32:04,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:32:04,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:32:04,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:32:04,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:32:04,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:32:04,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:32:04,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:32:04,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:32:04,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:32:04,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:32:04,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:32:04,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:32:04,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:32:04,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:32:04,179 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:32:04,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:32:04,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:32:04,180 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:32:04,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:32:04,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:32:04,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:32:04,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:32:04,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:32:04,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:32:04,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:32:04,181 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:32:04,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:32:04,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:32:04,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:32:04,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:32:04,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:32:04,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:32:04,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:32:04,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:32:04,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:32:04,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:32:04,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:32:04,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:32:04,183 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:32:04,183 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:32:04,184 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 22:32:04,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:32:04,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:32:04,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:32:04,362 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:32:04,363 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:32:04,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-07 22:32:04,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639980292/e1af4300449049f1a964edd6e24a8a0d/FLAG268d22b63 [2022-04-07 22:32:04,762 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:32:04,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i [2022-04-07 22:32:04,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639980292/e1af4300449049f1a964edd6e24a8a0d/FLAG268d22b63 [2022-04-07 22:32:05,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639980292/e1af4300449049f1a964edd6e24a8a0d [2022-04-07 22:32:05,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:32:05,212 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:32:05,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:32:05,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:32:05,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:32:05,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:32:05" (1/1) ... [2022-04-07 22:32:05,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d640dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:32:05, skipping insertion in model container [2022-04-07 22:32:05,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:32:05" (1/1) ... [2022-04-07 22:32:05,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:32:05,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:32:05,391 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-invgen/nested9.i[893,906] [2022-04-07 22:32:05,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:32:05,416 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:32:05,429 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-invgen/nested9.i[893,906] [2022-04-07 22:32:05,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:32:05,445 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:32:05,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:32:05 WrapperNode [2022-04-07 22:32:05,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:32:05,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:32:05,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:32:05,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:32:05,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:32:05" (1/1) ... [2022-04-07 22:32:05,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:32:05" (1/1) ... [2022-04-07 22:32:05,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:32:05" (1/1) ... [2022-04-07 22:32:05,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:32:05" (1/1) ... [2022-04-07 22:32:05,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:32:05" (1/1) ... [2022-04-07 22:32:05,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:32:05" (1/1) ... [2022-04-07 22:32:05,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:32:05" (1/1) ... [2022-04-07 22:32:05,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:32:05,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:32:05,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:32:05,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:32:05,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:32:05" (1/1) ... [2022-04-07 22:32:05,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:32:05,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:32:05,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 22:32:05,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 22:32:05,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:32:05,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:32:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:32:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 22:32:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:32:05,561 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:32:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:32:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:32:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 22:32:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 22:32:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:32:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:32:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 22:32:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:32:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 22:32:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:32:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:32:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:32:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:32:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:32:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:32:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:32:05,642 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:32:05,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:32:05,827 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:32:05,835 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:32:05,835 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 22:32:05,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:32:05 BoogieIcfgContainer [2022-04-07 22:32:05,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:32:05,837 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:32:05,838 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:32:05,839 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:32:05,841 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:32:05" (1/1) ... [2022-04-07 22:32:05,842 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:32:05,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:32:05 BasicIcfg [2022-04-07 22:32:05,887 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:32:05,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:32:05,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:32:05,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:32:05,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:32:05" (1/4) ... [2022-04-07 22:32:05,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2650c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:32:05, skipping insertion in model container [2022-04-07 22:32:05,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:32:05" (2/4) ... [2022-04-07 22:32:05,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2650c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:32:05, skipping insertion in model container [2022-04-07 22:32:05,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:32:05" (3/4) ... [2022-04-07 22:32:05,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2650c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:32:05, skipping insertion in model container [2022-04-07 22:32:05,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:32:05" (4/4) ... [2022-04-07 22:32:05,899 INFO L111 eAbstractionObserver]: Analyzing ICFG nested9.iqvasr [2022-04-07 22:32:05,905 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:32:05,905 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:32:05,944 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:32:05,953 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 22:32:05,953 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:32:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 22:32:05,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:32:05,974 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:32:05,975 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:32:05,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:32:05,979 INFO L85 PathProgramCache]: Analyzing trace with hash -340968139, now seen corresponding path program 1 times [2022-04-07 22:32:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:32:05,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862889648] [2022-04-07 22:32:05,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:32:05,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:32:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:06,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:32:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:06,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {32#true} is VALID [2022-04-07 22:32:06,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 22:32:06,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 22:32:06,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:32:06,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {32#true} is VALID [2022-04-07 22:32:06,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 22:32:06,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 22:32:06,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 22:32:06,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {32#true} is VALID [2022-04-07 22:32:06,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 22:32:06,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 22:32:06,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 22:32:06,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-07 22:32:06,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {37#(= main_~i~0 0)} is VALID [2022-04-07 22:32:06,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {38#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-07 22:32:06,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-07 22:32:06,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-07 22:32:06,276 INFO L272 TraceCheckUtils]: 14: Hoare triple {39#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {40#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:32:06,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#(not (= |__VERIFIER_assert_#in~cond| 0))} [127] __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] {41#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:32:06,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#(not (= __VERIFIER_assert_~cond 0))} [128] 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[] {33#false} is VALID [2022-04-07 22:32:06,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-07 22:32:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:32:06,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:32:06,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862889648] [2022-04-07 22:32:06,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862889648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:32:06,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:32:06,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 22:32:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403872942] [2022-04-07 22:32:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:32:06,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-07 22:32:06,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:32:06,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:32:06,314 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-07 22:32:06,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 22:32:06,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:32:06,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 22:32:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 22:32:06,333 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:32:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:06,811 INFO L93 Difference]: Finished difference Result 67 states and 98 transitions. [2022-04-07 22:32:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 22:32:06,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-07 22:32:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:32:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:32:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-07 22:32:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:32:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-07 22:32:06,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2022-04-07 22:32:06,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:32:06,906 INFO L225 Difference]: With dead ends: 67 [2022-04-07 22:32:06,906 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 22:32:06,910 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-07 22:32:06,913 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 22:32:06,913 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 54 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 22:32:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 22:32:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-07 22:32:06,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:32:06,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:06,940 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:06,940 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:06,944 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-07 22:32:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-07 22:32:06,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:06,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:06,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-07 22:32:06,945 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-07 22:32:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:06,947 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-07 22:32:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-07 22:32:06,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:06,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:06,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:32:06,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:32:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-07 22:32:06,962 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 18 [2022-04-07 22:32:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:32:06,962 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-07 22:32:06,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:32:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-07 22:32:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 22:32:06,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:32:06,963 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:32:06,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:32:06,964 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:32:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:32:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1058544685, now seen corresponding path program 1 times [2022-04-07 22:32:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:32:06,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402544516] [2022-04-07 22:32:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:32:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:32:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:07,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:32:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:07,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {283#true} is VALID [2022-04-07 22:32:07,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {283#true} {283#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {283#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:32:07,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {283#true} is VALID [2022-04-07 22:32:07,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {283#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {283#true} is VALID [2022-04-07 22:32:07,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {283#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {288#(= main_~i~0 0)} is VALID [2022-04-07 22:32:07,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {288#(= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {289#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-07 22:32:07,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {289#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-07 22:32:07,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {289#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {290#(<= 1 main_~n~0)} is VALID [2022-04-07 22:32:07,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {290#(<= 1 main_~n~0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {291#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:07,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {291#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:07,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {291#(<= (+ main_~j~0 2) (+ main_~i~0 (* main_~n~0 2)))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {292#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:07,084 INFO L272 TraceCheckUtils]: 17: Hoare triple {292#(<= (+ main_~k~0 3) (+ main_~i~0 (* main_~n~0 2)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:32:07,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {293#(not (= |__VERIFIER_assert_#in~cond| 0))} [127] __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] {294#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:32:07,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {294#(not (= __VERIFIER_assert_~cond 0))} [128] 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[] {284#false} is VALID [2022-04-07 22:32:07,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {284#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {284#false} is VALID [2022-04-07 22:32:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:32:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:32:07,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402544516] [2022-04-07 22:32:07,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402544516] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:32:07,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863165204] [2022-04-07 22:32:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:32:07,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:32:07,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:32:07,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:32:07,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 22:32:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:07,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 22:32:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:07,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:32:07,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {283#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {283#true} is VALID [2022-04-07 22:32:07,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {283#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {283#true} is VALID [2022-04-07 22:32:07,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {283#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {283#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {283#true} is VALID [2022-04-07 22:32:07,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {329#(<= 0 main_~i~0)} is VALID [2022-04-07 22:32:07,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {329#(<= 0 main_~i~0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {329#(<= 0 main_~i~0)} is VALID [2022-04-07 22:32:07,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {329#(<= 0 main_~i~0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {329#(<= 0 main_~i~0)} is VALID [2022-04-07 22:32:07,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {329#(<= 0 main_~i~0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {339#(<= 1 main_~i~0)} is VALID [2022-04-07 22:32:07,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {339#(<= 1 main_~i~0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {343#(and (< main_~i~0 main_~n~0) (<= 1 main_~i~0))} is VALID [2022-04-07 22:32:07,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {343#(and (< main_~i~0 main_~n~0) (<= 1 main_~i~0))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {347#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} is VALID [2022-04-07 22:32:07,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {347#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {347#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} is VALID [2022-04-07 22:32:07,503 INFO L272 TraceCheckUtils]: 17: Hoare triple {347#(and (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0) (<= 1 main_~i~0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {354#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:32:07,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {354#(<= 1 |__VERIFIER_assert_#in~cond|)} [127] __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] {358#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:32:07,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {358#(<= 1 __VERIFIER_assert_~cond)} [128] 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[] {284#false} is VALID [2022-04-07 22:32:07,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {284#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {284#false} is VALID [2022-04-07 22:32:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:32:07,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 22:32:07,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863165204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:32:07,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 22:32:07,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-04-07 22:32:07,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616746777] [2022-04-07 22:32:07,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:32:07,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 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 21 [2022-04-07 22:32:07,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:32:07,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:32:07,520 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-07 22:32:07,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 22:32:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:32:07,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 22:32:07,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-07 22:32:07,521 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:32:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:07,705 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-07 22:32:07,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 22:32:07,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 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 21 [2022-04-07 22:32:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:32:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:32:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-07 22:32:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:32:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-07 22:32:07,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2022-04-07 22:32:07,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:32:07,746 INFO L225 Difference]: With dead ends: 49 [2022-04-07 22:32:07,746 INFO L226 Difference]: Without dead ends: 47 [2022-04-07 22:32:07,746 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-07 22:32:07,747 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 22:32:07,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 89 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 22:32:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-07 22:32:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-04-07 22:32:07,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:32:07,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:07,763 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:07,764 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:07,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:07,766 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-07 22:32:07,766 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-07 22:32:07,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:07,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:07,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-07 22:32:07,767 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-07 22:32:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:07,768 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-07 22:32:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-07 22:32:07,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:07,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:07,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:32:07,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:32:07,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-07 22:32:07,770 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2022-04-07 22:32:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:32:07,771 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-07 22:32:07,771 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:32:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-07 22:32:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 22:32:07,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:32:07,771 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:32:07,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 22:32:07,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:32:07,988 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:32:07,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:32:07,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1484070290, now seen corresponding path program 1 times [2022-04-07 22:32:07,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:32:07,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100443794] [2022-04-07 22:32:07,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:32:07,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:32:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:08,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:32:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:08,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {571#true} is VALID [2022-04-07 22:32:08,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {571#true} {571#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-07 22:32:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:08,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {571#true} [127] __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] {571#true} is VALID [2022-04-07 22:32:08,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {571#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {571#true} {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-07 22:32:08,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:32:08,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {571#true} is VALID [2022-04-07 22:32:08,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {571#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {571#true} {571#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {571#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {571#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {571#true} is VALID [2022-04-07 22:32:08,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {571#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {571#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {576#(= main_~i~0 0)} is VALID [2022-04-07 22:32:08,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#(= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {577#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} is VALID [2022-04-07 22:32:08,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {577#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-07 22:32:08,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-07 22:32:08,080 INFO L272 TraceCheckUtils]: 14: Hoare triple {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {571#true} is VALID [2022-04-07 22:32:08,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {571#true} [127] __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] {571#true} is VALID [2022-04-07 22:32:08,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {571#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {571#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,081 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {571#true} {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-07 22:32:08,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {578#(and (<= (+ main_~i~0 1) main_~n~0) (= main_~k~0 0) (= main_~i~0 0))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {583#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} is VALID [2022-04-07 22:32:08,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {583#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {583#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} is VALID [2022-04-07 22:32:08,083 INFO L272 TraceCheckUtils]: 21: Hoare triple {583#(and (<= (+ main_~k~0 (* main_~i~0 2) 1) (* main_~n~0 2)) (= main_~i~0 0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:32:08,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {584#(not (= |__VERIFIER_assert_#in~cond| 0))} [127] __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] {585#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:32:08,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {585#(not (= __VERIFIER_assert_~cond 0))} [128] 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[] {572#false} is VALID [2022-04-07 22:32:08,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {572#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {572#false} is VALID [2022-04-07 22:32:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:32:08,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:32:08,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100443794] [2022-04-07 22:32:08,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100443794] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:32:08,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294589749] [2022-04-07 22:32:08,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:32:08,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:32:08,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:32:08,086 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:32:08,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 22:32:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:08,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 22:32:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:08,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:32:08,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#true} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {571#true} is VALID [2022-04-07 22:32:08,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {571#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {571#true} {571#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {571#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {571#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {571#true} is VALID [2022-04-07 22:32:08,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {571#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {571#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {571#true} is VALID [2022-04-07 22:32:08,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {620#(<= main_~i~0 0)} is VALID [2022-04-07 22:32:08,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {620#(<= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {624#(and (<= main_~i~0 0) (<= (* main_~i~0 2) main_~j~0))} is VALID [2022-04-07 22:32:08,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {624#(and (<= main_~i~0 0) (<= (* main_~i~0 2) main_~j~0))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {572#false} is VALID [2022-04-07 22:32:08,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {572#false} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {572#false} is VALID [2022-04-07 22:32:08,246 INFO L272 TraceCheckUtils]: 14: Hoare triple {572#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {572#false} is VALID [2022-04-07 22:32:08,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {572#false} [127] __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] {572#false} is VALID [2022-04-07 22:32:08,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {572#false} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {572#false} is VALID [2022-04-07 22:32:08,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {572#false} is VALID [2022-04-07 22:32:08,247 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {572#false} {572#false} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {572#false} is VALID [2022-04-07 22:32:08,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {572#false} is VALID [2022-04-07 22:32:08,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {572#false} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {572#false} is VALID [2022-04-07 22:32:08,247 INFO L272 TraceCheckUtils]: 21: Hoare triple {572#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {572#false} is VALID [2022-04-07 22:32:08,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {572#false} [127] __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] {572#false} is VALID [2022-04-07 22:32:08,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {572#false} [128] 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[] {572#false} is VALID [2022-04-07 22:32:08,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {572#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {572#false} is VALID [2022-04-07 22:32:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 22:32:08,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 22:32:08,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294589749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:32:08,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 22:32:08,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-04-07 22:32:08,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100409205] [2022-04-07 22:32:08,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:32:08,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-07 22:32:08,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:32:08,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:32:08,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:32:08,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:32:08,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:32:08,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:32:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-07 22:32:08,264 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:32:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:08,306 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-07 22:32:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:32:08,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-07 22:32:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:32:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:32:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-07 22:32:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:32:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-07 22:32:08,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-04-07 22:32:08,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:32:08,338 INFO L225 Difference]: With dead ends: 52 [2022-04-07 22:32:08,338 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 22:32:08,339 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-07 22:32:08,341 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:32:08,342 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:32:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 22:32:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-07 22:32:08,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:32:08,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:08,365 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:08,365 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:08,369 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 22:32:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 22:32:08,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:08,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:08,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-07 22:32:08,371 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-04-07 22:32:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:08,374 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 22:32:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 22:32:08,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:08,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:08,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:32:08,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:32:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-07 22:32:08,378 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2022-04-07 22:32:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:32:08,378 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-07 22:32:08,378 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:32:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-07 22:32:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 22:32:08,380 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:32:08,380 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:32:08,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 22:32:08,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 22:32:08,591 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:32:08,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:32:08,592 INFO L85 PathProgramCache]: Analyzing trace with hash 551024538, now seen corresponding path program 1 times [2022-04-07 22:32:08,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:32:08,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863567573] [2022-04-07 22:32:08,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:32:08,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:32:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:32:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:08,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {863#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {849#true} is VALID [2022-04-07 22:32:08,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {849#true} {849#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 22:32:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:08,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {849#true} [127] __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] {849#true} is VALID [2022-04-07 22:32:08,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {849#true} {857#(<= main_~j~0 (+ main_~k~0 1))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-07 22:32:08,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {849#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {863#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:32:08,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {863#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {849#true} is VALID [2022-04-07 22:32:08,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {849#true} {849#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {849#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {849#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {849#true} is VALID [2022-04-07 22:32:08,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {849#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {854#(= main_~i~0 0)} is VALID [2022-04-07 22:32:08,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {854#(= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {854#(= main_~i~0 0)} is VALID [2022-04-07 22:32:08,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {854#(= main_~i~0 0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {854#(= main_~i~0 0)} is VALID [2022-04-07 22:32:08,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {854#(= main_~i~0 0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {855#(<= main_~i~0 1)} is VALID [2022-04-07 22:32:08,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {855#(<= main_~i~0 1)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {856#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2022-04-07 22:32:08,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {856#(<= main_~j~0 (+ main_~i~0 1))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-07 22:32:08,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-07 22:32:08,685 INFO L272 TraceCheckUtils]: 17: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {849#true} is VALID [2022-04-07 22:32:08,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {849#true} [127] __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] {849#true} is VALID [2022-04-07 22:32:08,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {849#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:08,686 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {849#true} {857#(<= main_~j~0 (+ main_~k~0 1))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-07 22:32:08,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {862#(<= main_~j~0 main_~k~0)} is VALID [2022-04-07 22:32:08,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {862#(<= main_~j~0 main_~k~0)} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-07 22:32:08,687 INFO L272 TraceCheckUtils]: 24: Hoare triple {850#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {850#false} is VALID [2022-04-07 22:32:08,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {850#false} [127] __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] {850#false} is VALID [2022-04-07 22:32:08,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {850#false} [128] 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[] {850#false} is VALID [2022-04-07 22:32:08,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {850#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-07 22:32:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:32:08,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:32:08,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863567573] [2022-04-07 22:32:08,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863567573] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:32:08,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441469409] [2022-04-07 22:32:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:32:08,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:32:08,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:32:08,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:32:08,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 22:32:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:08,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 22:32:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:08,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:32:09,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {849#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#true} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {849#true} is VALID [2022-04-07 22:32:09,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {849#true} {849#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {849#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {849#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {849#true} is VALID [2022-04-07 22:32:09,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {849#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {897#(<= main_~i~0 0)} is VALID [2022-04-07 22:32:09,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#(<= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {897#(<= main_~i~0 0)} is VALID [2022-04-07 22:32:09,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#(<= main_~i~0 0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {897#(<= main_~i~0 0)} is VALID [2022-04-07 22:32:09,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {897#(<= main_~i~0 0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {855#(<= main_~i~0 1)} is VALID [2022-04-07 22:32:09,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {855#(<= main_~i~0 1)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {910#(and (<= main_~j~0 (* main_~i~0 2)) (<= main_~i~0 1))} is VALID [2022-04-07 22:32:09,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {910#(and (<= main_~j~0 (* main_~i~0 2)) (<= main_~i~0 1))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} is VALID [2022-04-07 22:32:09,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} is VALID [2022-04-07 22:32:09,578 INFO L272 TraceCheckUtils]: 17: Hoare triple {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {849#true} is VALID [2022-04-07 22:32:09,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {849#true} [127] __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] {849#true} is VALID [2022-04-07 22:32:09,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {849#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,580 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {849#true} {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} is VALID [2022-04-07 22:32:09,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {914#(and (<= (div (- main_~j~0) (- 2)) 1) (<= (div (- main_~j~0) (- 2)) main_~k~0))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {936#(and (<= (+ (div (* (- 1) main_~j~0) (- 2)) 1) main_~k~0) (<= (div (- main_~j~0) (- 2)) 1))} is VALID [2022-04-07 22:32:09,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {936#(and (<= (+ (div (* (- 1) main_~j~0) (- 2)) 1) main_~k~0) (<= (div (- main_~j~0) (- 2)) 1))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-07 22:32:09,583 INFO L272 TraceCheckUtils]: 24: Hoare triple {850#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {850#false} is VALID [2022-04-07 22:32:09,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {850#false} [127] __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] {850#false} is VALID [2022-04-07 22:32:09,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {850#false} [128] 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[] {850#false} is VALID [2022-04-07 22:32:09,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {850#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-07 22:32:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:32:09,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:32:09,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {850#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-07 22:32:09,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {850#false} [128] 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[] {850#false} is VALID [2022-04-07 22:32:09,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {850#false} [127] __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] {850#false} is VALID [2022-04-07 22:32:09,701 INFO L272 TraceCheckUtils]: 24: Hoare triple {850#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {850#false} is VALID [2022-04-07 22:32:09,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {862#(<= main_~j~0 main_~k~0)} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {850#false} is VALID [2022-04-07 22:32:09,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {862#(<= main_~j~0 main_~k~0)} is VALID [2022-04-07 22:32:09,702 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {849#true} {857#(<= main_~j~0 (+ main_~k~0 1))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-07 22:32:09,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {849#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {849#true} [127] __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] {849#true} is VALID [2022-04-07 22:32:09,703 INFO L272 TraceCheckUtils]: 17: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {849#true} is VALID [2022-04-07 22:32:09,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {857#(<= main_~j~0 (+ main_~k~0 1))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-07 22:32:09,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {856#(<= main_~j~0 (+ main_~i~0 1))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {857#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2022-04-07 22:32:09,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {855#(<= main_~i~0 1)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {856#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2022-04-07 22:32:09,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {897#(<= main_~i~0 0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {855#(<= main_~i~0 1)} is VALID [2022-04-07 22:32:09,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#(<= main_~i~0 0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {897#(<= main_~i~0 0)} is VALID [2022-04-07 22:32:09,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#(<= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {897#(<= main_~i~0 0)} is VALID [2022-04-07 22:32:09,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {849#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {897#(<= main_~i~0 0)} is VALID [2022-04-07 22:32:09,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {849#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {849#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {849#true} is VALID [2022-04-07 22:32:09,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {849#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {849#true} {849#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {849#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#true} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {849#true} is VALID [2022-04-07 22:32:09,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {849#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {849#true} is VALID [2022-04-07 22:32:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:32:09,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441469409] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:32:09,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:32:09,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-07 22:32:09,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204834969] [2022-04-07 22:32:09,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:32:09,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-07 22:32:09,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:32:09,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:09,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:32:09,740 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 22:32:09,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:32:09,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 22:32:09,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-07 22:32:09,741 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:10,301 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-07 22:32:10,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 22:32:10,301 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-07 22:32:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:32:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-07 22:32:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-07 22:32:10,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-07 22:32:10,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:32:10,354 INFO L225 Difference]: With dead ends: 66 [2022-04-07 22:32:10,354 INFO L226 Difference]: Without dead ends: 47 [2022-04-07 22:32:10,355 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-04-07 22:32:10,355 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 22:32:10,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 55 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 22:32:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-07 22:32:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-07 22:32:10,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:32:10,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:10,401 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:10,401 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:10,402 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-07 22:32:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-07 22:32:10,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:10,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:10,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-04-07 22:32:10,403 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-04-07 22:32:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:10,418 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-07 22:32:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-07 22:32:10,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:10,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:10,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:32:10,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:32:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-04-07 22:32:10,420 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 28 [2022-04-07 22:32:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:32:10,420 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-04-07 22:32:10,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:32:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-07 22:32:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 22:32:10,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:32:10,421 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:32:10,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 22:32:10,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:32:10,636 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:32:10,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:32:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1358482081, now seen corresponding path program 1 times [2022-04-07 22:32:10,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:32:10,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451865242] [2022-04-07 22:32:10,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:32:10,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:32:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:10,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:32:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:10,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {1317#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1306#true} is VALID [2022-04-07 22:32:10,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1306#true} {1306#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-07 22:32:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:10,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} [127] __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] {1306#true} is VALID [2022-04-07 22:32:10,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1307#false} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1307#false} is VALID [2022-04-07 22:32:10,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1317#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:32:10,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {1317#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1306#true} is VALID [2022-04-07 22:32:10,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1306#true} is VALID [2022-04-07 22:32:10,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {1306#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {1306#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {1306#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {1306#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1306#true} is VALID [2022-04-07 22:32:10,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {1306#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1306#true} is VALID [2022-04-07 22:32:10,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {1306#true} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {1306#true} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1306#true} is VALID [2022-04-07 22:32:10,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {1306#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1311#(<= (* main_~i~0 2) main_~j~0)} is VALID [2022-04-07 22:32:10,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {1311#(<= (* main_~i~0 2) main_~j~0)} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1312#(<= (+ main_~k~0 1) main_~j~0)} is VALID [2022-04-07 22:32:10,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {1312#(<= (+ main_~k~0 1) main_~j~0)} [122] L36-2-->L35-2: Formula: (not (< v_main_~k~0_3 v_main_~j~0_7)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[] {1307#false} is VALID [2022-04-07 22:32:10,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {1307#false} [124] L35-2-->L35-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1307#false} is VALID [2022-04-07 22:32:10,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {1307#false} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1307#false} is VALID [2022-04-07 22:32:10,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {1307#false} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1307#false} is VALID [2022-04-07 22:32:10,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {1307#false} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1307#false} is VALID [2022-04-07 22:32:10,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {1307#false} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1307#false} is VALID [2022-04-07 22:32:10,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {1307#false} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1307#false} is VALID [2022-04-07 22:32:10,719 INFO L272 TraceCheckUtils]: 23: Hoare triple {1307#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1306#true} is VALID [2022-04-07 22:32:10,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} [127] __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] {1306#true} is VALID [2022-04-07 22:32:10,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {1306#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#true} is VALID [2022-04-07 22:32:10,720 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1306#true} {1307#false} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1307#false} is VALID [2022-04-07 22:32:10,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {1307#false} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1307#false} is VALID [2022-04-07 22:32:10,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {1307#false} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1307#false} is VALID [2022-04-07 22:32:10,720 INFO L272 TraceCheckUtils]: 30: Hoare triple {1307#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1307#false} is VALID [2022-04-07 22:32:10,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} [127] __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] {1307#false} is VALID [2022-04-07 22:32:10,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} [128] 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[] {1307#false} is VALID [2022-04-07 22:32:10,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1307#false} is VALID [2022-04-07 22:32:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 22:32:10,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:32:10,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451865242] [2022-04-07 22:32:10,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451865242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:32:10,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:32:10,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 22:32:10,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308411694] [2022-04-07 22:32:10,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:32:10,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-04-07 22:32:10,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:32:10,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:32:10,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:32:10,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 22:32:10,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:32:10,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 22:32:10,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 22:32:10,739 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:32:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:10,884 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-07 22:32:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 22:32:10,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-04-07 22:32:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:32:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:32:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-07 22:32:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:32:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-07 22:32:10,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-07 22:32:10,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:32:10,918 INFO L225 Difference]: With dead ends: 66 [2022-04-07 22:32:10,918 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 22:32:10,918 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-07 22:32:10,919 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:32:10,919 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 30 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:32:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 22:32:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-07 22:32:10,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:32:10,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:10,975 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:10,976 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:10,977 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 22:32:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-07 22:32:10,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:10,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:10,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-07 22:32:10,978 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 41 states. [2022-04-07 22:32:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:10,979 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 22:32:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-07 22:32:10,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:10,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:10,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:32:10,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:32:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 22:32:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-07 22:32:10,980 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 34 [2022-04-07 22:32:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:32:10,980 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-07 22:32:10,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:32:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-07 22:32:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 22:32:10,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:32:10,981 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:32:10,981 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 22:32:10,981 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:32:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:32:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1686349908, now seen corresponding path program 2 times [2022-04-07 22:32:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:32:10,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232618636] [2022-04-07 22:32:10,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:32:10,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:32:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:32:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:11,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {1586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1566#true} is VALID [2022-04-07 22:32:11,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1566#true} {1566#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 22:32:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:11,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {1566#true} [127] __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] {1566#true} is VALID [2022-04-07 22:32:11,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1573#(<= 2 main_~n~0)} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1573#(<= 2 main_~n~0)} is VALID [2022-04-07 22:32:11,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-07 22:32:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:11,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {1566#true} [127] __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] {1566#true} is VALID [2022-04-07 22:32:11,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:11,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:32:11,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {1586#(and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1566#true} is VALID [2022-04-07 22:32:11,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1566#true} is VALID [2022-04-07 22:32:11,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {1566#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {1566#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1571#(= main_~i~0 0)} is VALID [2022-04-07 22:32:11,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {1571#(= main_~i~0 0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1571#(= main_~i~0 0)} is VALID [2022-04-07 22:32:11,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#(= main_~i~0 0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1571#(= main_~i~0 0)} is VALID [2022-04-07 22:32:11,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {1571#(= main_~i~0 0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1572#(<= 1 main_~i~0)} is VALID [2022-04-07 22:32:11,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {1572#(<= 1 main_~i~0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1573#(<= 2 main_~n~0)} is VALID [2022-04-07 22:32:11,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {1573#(<= 2 main_~n~0)} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1573#(<= 2 main_~n~0)} is VALID [2022-04-07 22:32:11,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {1573#(<= 2 main_~n~0)} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1573#(<= 2 main_~n~0)} is VALID [2022-04-07 22:32:11,089 INFO L272 TraceCheckUtils]: 17: Hoare triple {1573#(<= 2 main_~n~0)} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1566#true} is VALID [2022-04-07 22:32:11,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} [127] __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] {1566#true} is VALID [2022-04-07 22:32:11,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,089 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1566#true} {1573#(<= 2 main_~n~0)} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1573#(<= 2 main_~n~0)} is VALID [2022-04-07 22:32:11,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {1573#(<= 2 main_~n~0)} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1573#(<= 2 main_~n~0)} is VALID [2022-04-07 22:32:11,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {1573#(<= 2 main_~n~0)} [122] L36-2-->L35-2: Formula: (not (< v_main_~k~0_3 v_main_~j~0_7)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[] {1573#(<= 2 main_~n~0)} is VALID [2022-04-07 22:32:11,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {1573#(<= 2 main_~n~0)} [124] L35-2-->L35-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1573#(<= 2 main_~n~0)} is VALID [2022-04-07 22:32:11,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {1573#(<= 2 main_~n~0)} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1573#(<= 2 main_~n~0)} is VALID [2022-04-07 22:32:11,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {1573#(<= 2 main_~n~0)} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1573#(<= 2 main_~n~0)} is VALID [2022-04-07 22:32:11,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {1573#(<= 2 main_~n~0)} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:11,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:11,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:11,092 INFO L272 TraceCheckUtils]: 30: Hoare triple {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1566#true} is VALID [2022-04-07 22:32:11,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {1566#true} [127] __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] {1566#true} is VALID [2022-04-07 22:32:11,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {1566#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {1566#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,093 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1566#true} {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:11,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:11,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {1578#(<= (+ main_~j~0 3) (+ main_~i~0 (* main_~n~0 2)))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1583#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:11,094 INFO L272 TraceCheckUtils]: 37: Hoare triple {1583#(<= (+ main_~k~0 4) (+ main_~i~0 (* main_~n~0 2)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:32:11,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {1584#(not (= |__VERIFIER_assert_#in~cond| 0))} [127] __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] {1585#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:32:11,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#(not (= __VERIFIER_assert_~cond 0))} [128] 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[] {1567#false} is VALID [2022-04-07 22:32:11,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {1567#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1567#false} is VALID [2022-04-07 22:32:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 22:32:11,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:32:11,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232618636] [2022-04-07 22:32:11,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232618636] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:32:11,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646411050] [2022-04-07 22:32:11,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 22:32:11,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:32:11,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:32:11,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:32:11,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 22:32:11,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-07 22:32:11,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 22:32:11,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 22:32:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:32:11,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:32:11,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1566#true} is VALID [2022-04-07 22:32:11,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1566#true} is VALID [2022-04-07 22:32:11,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {1566#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {1566#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1566#true} is VALID [2022-04-07 22:32:11,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {1566#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1566#true} is VALID [2022-04-07 22:32:11,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {1566#true} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1566#true} is VALID [2022-04-07 22:32:11,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {1566#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1566#true} is VALID [2022-04-07 22:32:11,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {1566#true} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1566#true} is VALID [2022-04-07 22:32:11,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {1566#true} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,452 INFO L272 TraceCheckUtils]: 17: Hoare triple {1566#true} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1566#true} is VALID [2022-04-07 22:32:11,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} [127] __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] {1566#true} is VALID [2022-04-07 22:32:11,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,453 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1566#true} {1566#true} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1566#true} is VALID [2022-04-07 22:32:11,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {1566#true} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1566#true} is VALID [2022-04-07 22:32:11,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} [122] L36-2-->L35-2: Formula: (not (< v_main_~k~0_3 v_main_~j~0_7)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} [124] L35-2-->L35-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1566#true} is VALID [2022-04-07 22:32:11,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {1566#true} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1566#true} is VALID [2022-04-07 22:32:11,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {1566#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1671#(< main_~i~0 main_~n~0)} is VALID [2022-04-07 22:32:11,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {1671#(< main_~i~0 main_~n~0)} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-07 22:32:11,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-07 22:32:11,454 INFO L272 TraceCheckUtils]: 30: Hoare triple {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1566#true} is VALID [2022-04-07 22:32:11,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {1566#true} [127] __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] {1566#true} is VALID [2022-04-07 22:32:11,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {1566#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {1566#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,455 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1566#true} {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-07 22:32:11,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} is VALID [2022-04-07 22:32:11,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {1675#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1700#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} is VALID [2022-04-07 22:32:11,457 INFO L272 TraceCheckUtils]: 37: Hoare triple {1700#(and (< main_~i~0 main_~n~0) (< (+ main_~k~0 1) (* main_~i~0 3)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:32:11,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} [127] __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] {1708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:32:11,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {1708#(<= 1 __VERIFIER_assert_~cond)} [128] 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[] {1567#false} is VALID [2022-04-07 22:32:11,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {1567#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1567#false} is VALID [2022-04-07 22:32:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 22:32:11,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:32:11,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {1567#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1567#false} is VALID [2022-04-07 22:32:11,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {1708#(<= 1 __VERIFIER_assert_~cond)} [128] 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[] {1567#false} is VALID [2022-04-07 22:32:11,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} [127] __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] {1708#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 22:32:11,662 INFO L272 TraceCheckUtils]: 37: Hoare triple {1724#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1704#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 22:32:11,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1724#(<= main_~k~0 (+ main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:11,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-07 22:32:11,665 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1566#true} {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-07 22:32:11,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {1566#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {1566#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {1566#true} [127] __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] {1566#true} is VALID [2022-04-07 22:32:11,665 INFO L272 TraceCheckUtils]: 30: Hoare triple {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1566#true} is VALID [2022-04-07 22:32:11,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-07 22:32:11,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {1753#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1728#(<= main_~j~0 (+ main_~i~0 (* main_~n~0 2) 1))} is VALID [2022-04-07 22:32:11,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {1566#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1753#(<= (* main_~i~0 2) (+ 2 (* main_~n~0 2)))} is VALID [2022-04-07 22:32:11,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {1566#true} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1566#true} is VALID [2022-04-07 22:32:11,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} [124] L35-2-->L35-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1566#true} is VALID [2022-04-07 22:32:11,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} [122] L36-2-->L35-2: Formula: (not (< v_main_~k~0_3 v_main_~j~0_7)) InVars {main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} OutVars{main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {1566#true} [126] L37-1-->L36-2: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1566#true} is VALID [2022-04-07 22:32:11,667 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1566#true} {1566#true} [135] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1566#true} is VALID [2022-04-07 22:32:11,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#true} [129] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} [127] __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] {1566#true} is VALID [2022-04-07 22:32:11,668 INFO L272 TraceCheckUtils]: 17: Hoare triple {1566#true} [125] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~k~0_8 (+ v_main_~i~0_10 (* v_main_~n~0_11 2))) 1 0)) InVars {main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_11, main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~i~0, main_~n~0] {1566#true} is VALID [2022-04-07 22:32:11,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {1566#true} [123] L36-2-->L37: Formula: (< v_main_~k~0_4 v_main_~j~0_8) InVars {main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} OutVars{main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {1566#true} [119] L35-3-->L36-2: Formula: (and (= v_main_~i~0_8 v_main_~k~0_2) (< v_main_~j~0_6 (* v_main_~i~0_8 3))) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~k~0] {1566#true} is VALID [2022-04-07 22:32:11,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {1566#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1566#true} is VALID [2022-04-07 22:32:11,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} [120] L34-2-->L34-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1566#true} is VALID [2022-04-07 22:32:11,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {1566#true} [118] L35-3-->L34-2: Formula: (not (< v_main_~j~0_5 (* v_main_~i~0_7 3))) InVars {main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {1566#true} [116] L34-3-->L35-3: Formula: (and (= v_main_~j~0_4 (* v_main_~i~0_6 2)) (< v_main_~i~0_6 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1566#true} is VALID [2022-04-07 22:32:11,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {1566#true} [112] L33-1-->L34-3: Formula: (= v_main_~i~0_4 0) InVars {} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[main_~i~0] {1566#true} is VALID [2022-04-07 22:32:11,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} [110] L33-->L33-1: Formula: (<= (* v_main_~n~0_6 3) (+ v_main_~l~0_6 v_main_~m~0_6)) InVars {main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} OutVars{main_~l~0=v_main_~l~0_6, main_~n~0=v_main_~n~0_6, main_~m~0=v_main_~m~0_6} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} [109] L32-->L33: Formula: (and (< 0 (+ v_main_~l~0_5 1000000)) (< v_main_~l~0_5 1000000)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} [107] L31-->L32: Formula: (and (< 0 (+ v_main_~m~0_5 1000000)) (< v_main_~m~0_5 1000000)) InVars {main_~m~0=v_main_~m~0_5} OutVars{main_~m~0=v_main_~m~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {1566#true} [104] L30-->L31: Formula: (and (< 0 (+ v_main_~n~0_5 1000000)) (< v_main_~n~0_5 1000000)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} [101] mainENTRY-->L30: Formula: (and (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~l~0_1 |v_main_#t~nondet3_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet1_2|) (= v_main_~m~0_1 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~l~0=v_main_~l~0_1, main_~m~0=v_main_~m~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_~m~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~i~0, main_~n~0] {1566#true} is VALID [2022-04-07 22:32:11,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} [99] 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) (= v_~__BLAST_NONDET~0_1 0) (= 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{~__BLAST_NONDET~0=v_~__BLAST_NONDET~0_1, #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[~__BLAST_NONDET~0, #NULL.offset, #NULL.base] {1566#true} is VALID [2022-04-07 22:32:11,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1566#true} is VALID [2022-04-07 22:32:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 22:32:11,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646411050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:32:11,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:32:11,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2022-04-07 22:32:11,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444106090] [2022-04-07 22:32:11,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:32:11,671 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-04-07 22:32:11,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:32:11,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 22:32:11,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:32:11,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 22:32:11,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:32:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 22:32:11,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-07 22:32:11,713 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 22:32:12,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:12,319 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-04-07 22:32:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 22:32:12,319 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2022-04-07 22:32:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:32:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 22:32:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-07 22:32:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 22:32:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-07 22:32:12,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 49 transitions. [2022-04-07 22:32:12,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:32:12,359 INFO L225 Difference]: With dead ends: 68 [2022-04-07 22:32:12,359 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 22:32:12,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2022-04-07 22:32:12,361 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 22:32:12,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 65 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 22:32:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 22:32:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 22:32:12,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:32:12,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:32:12,362 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:32:12,362 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:32:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:12,362 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:32:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:32:12,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:12,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:12,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:32:12,362 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:32:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:32:12,362 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:32:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:32:12,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:12,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:32:12,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:32:12,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:32:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:32:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 22:32:12,363 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-04-07 22:32:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:32:12,363 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 22:32:12,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 8 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-07 22:32:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:32:12,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:32:12,365 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:32:12,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 22:32:12,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:32:12,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 22:32:12,874 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 22:32:12,875 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:32:12,875 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:32:12,875 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 22:32:12,875 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 22:32:12,875 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:32:12,875 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:32:12,875 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 25 40) the Hoare annotation is: true [2022-04-07 22:32:12,875 INFO L882 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2022-04-07 22:32:12,875 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 25 40) no Hoare annotation was computed. [2022-04-07 22:32:12,875 INFO L882 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-07 22:32:12,875 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 25 40) no Hoare annotation was computed. [2022-04-07 22:32:12,875 INFO L882 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-07 22:32:12,875 INFO L882 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-07 22:32:12,875 INFO L882 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-04-07 22:32:12,875 INFO L885 garLoopResultBuilder]: At program point L38(lines 25 40) the Hoare annotation is: true [2022-04-07 22:32:12,875 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: (let ((.cse0 (* main_~i~0 2)) (.cse3 (* main_~n~0 2))) (let ((.cse1 (<= .cse0 (+ 2 .cse3))) (.cse2 (<= 1 main_~i~0))) (or (and (<= main_~j~0 .cse0) (<= main_~i~0 1) .cse1 .cse2) (= main_~i~0 0) (and (<= 2 main_~n~0) (<= main_~k~0 (+ main_~i~0 .cse3)) (<= main_~j~0 (+ main_~i~0 .cse3 1)) .cse1 .cse2)))) [2022-04-07 22:32:12,876 INFO L878 garLoopResultBuilder]: At program point L35-3(lines 35 37) the Hoare annotation is: (let ((.cse2 (* main_~i~0 2))) (let ((.cse0 (< main_~i~0 main_~n~0)) (.cse3 (<= .cse2 main_~j~0)) (.cse1 (<= 1 main_~i~0))) (or (and (or (and .cse0 .cse1) (and (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0))) (<= main_~j~0 .cse2) (<= main_~i~0 1) .cse3) (let ((.cse4 (* main_~n~0 2))) (and .cse0 (<= main_~k~0 (+ main_~i~0 .cse4)) (<= main_~j~0 (+ main_~i~0 .cse4 1)) .cse3 .cse1))))) [2022-04-07 22:32:12,876 INFO L882 garLoopResultBuilder]: For program point L34-2(lines 34 37) no Hoare annotation was computed. [2022-04-07 22:32:12,876 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 37) the Hoare annotation is: (and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)) (<= main_~k~0 (+ main_~i~0 (* main_~n~0 2))) (<= (* main_~i~0 2) main_~j~0)) [2022-04-07 22:32:12,876 INFO L882 garLoopResultBuilder]: For program point L35-2(lines 35 37) no Hoare annotation was computed. [2022-04-07 22:32:12,876 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (< main_~i~0 main_~n~0) (< main_~j~0 (* main_~i~0 3)) (<= (* main_~i~0 2) main_~j~0) (<= (+ main_~k~0 1) main_~j~0)) [2022-04-07 22:32:12,876 INFO L882 garLoopResultBuilder]: For program point L37-1(lines 36 37) no Hoare annotation was computed. [2022-04-07 22:32:12,876 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-07 22:32:12,876 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-07 22:32:12,876 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-07 22:32:12,876 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-07 22:32:12,876 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-07 22:32:12,876 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-07 22:32:12,878 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-07 22:32:12,879 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-07 22:32:12,883 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:32:12,884 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:32:12,884 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-07 22:32:12,884 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-07 22:32:12,884 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-07 22:32:12,884 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 22:32:12,884 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:32:12,884 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-07 22:32:12,884 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-07 22:32:12,888 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-07 22:32:12,888 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-07 22:32:12,888 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-07 22:32:12,890 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-07 22:32:12,890 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 22:32:12,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:32:12 BasicIcfg [2022-04-07 22:32:12,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:32:12,900 INFO L158 Benchmark]: Toolchain (without parser) took 7687.57ms. Allocated memory was 182.5MB in the beginning and 318.8MB in the end (delta: 136.3MB). Free memory was 129.2MB in the beginning and 210.1MB in the end (delta: -80.9MB). Peak memory consumption was 55.7MB. Max. memory is 8.0GB. [2022-04-07 22:32:12,900 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:32:12,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.46ms. Allocated memory was 182.5MB in the beginning and 265.3MB in the end (delta: 82.8MB). Free memory was 129.1MB in the beginning and 241.6MB in the end (delta: -112.5MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-04-07 22:32:12,901 INFO L158 Benchmark]: Boogie Preprocessor took 39.62ms. Allocated memory is still 265.3MB. Free memory was 241.6MB in the beginning and 240.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:32:12,901 INFO L158 Benchmark]: RCFGBuilder took 349.07ms. Allocated memory is still 265.3MB. Free memory was 239.5MB in the beginning and 226.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 22:32:12,901 INFO L158 Benchmark]: IcfgTransformer took 49.69ms. Allocated memory is still 265.3MB. Free memory was 226.4MB in the beginning and 224.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 22:32:12,901 INFO L158 Benchmark]: TraceAbstraction took 7010.97ms. Allocated memory was 265.3MB in the beginning and 318.8MB in the end (delta: 53.5MB). Free memory was 223.8MB in the beginning and 210.1MB in the end (delta: 13.6MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. [2022-04-07 22:32:12,902 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 182.5MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.46ms. Allocated memory was 182.5MB in the beginning and 265.3MB in the end (delta: 82.8MB). Free memory was 129.1MB in the beginning and 241.6MB in the end (delta: -112.5MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.62ms. Allocated memory is still 265.3MB. Free memory was 241.6MB in the beginning and 240.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 349.07ms. Allocated memory is still 265.3MB. Free memory was 239.5MB in the beginning and 226.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 49.69ms. Allocated memory is still 265.3MB. Free memory was 226.4MB in the beginning and 224.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7010.97ms. Allocated memory was 265.3MB in the beginning and 318.8MB in the end (delta: 53.5MB). Free memory was 223.8MB in the beginning and 210.1MB in the end (delta: 13.6MB). Peak memory consumption was 67.6MB. 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 335 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 210 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 690 IncrementalHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 125 mSDtfsCounter, 690 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=4, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 29 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 23 PreInvPairs, 40 NumberOfFragments, 170 HoareAnnotationTreeSize, 23 FomulaSimplifications, 39 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 810 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 282 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 903 SizeOfPredicates, 12 NumberOfNonLiveVariables, 348 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 101/130 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: 35]: Loop Invariant Derived loop invariant: (((((i < n && 1 <= i) || (i + 1 <= n && i == 0)) && j <= i * 2) && i <= 1) && i * 2 <= j) || ((((i < n && k <= i + n * 2) && j <= i + n * 2 + 1) && i * 2 <= j) && 1 <= i) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((j <= i * 2 && i <= 1) && i * 2 <= 2 + n * 2) && 1 <= i) || i == 0) || ((((2 <= n && k <= i + n * 2) && j <= i + n * 2 + 1) && i * 2 <= 2 + n * 2) && 1 <= i) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((i < n && j < i * 3) && k <= i + n * 2) && i * 2 <= j RESULT: Ultimate proved your program to be correct! [2022-04-07 22:32:12,929 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...