/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/nla-digbench-scaling/ps6-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:39:57,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:39:57,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:39:57,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:39:57,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:39:57,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:39:57,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:39:57,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:39:57,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:39:57,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:39:57,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:39:57,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:39:57,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:39:57,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:39:57,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:39:57,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:39:57,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:39:57,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:39:57,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:39:57,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:39:57,454 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:39:57,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:39:57,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:39:57,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:39:57,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:39:57,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:39:57,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:39:57,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:39:57,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:39:57,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:39:57,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:39:57,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:39:57,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:39:57,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:39:57,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:39:57,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:39:57,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:39:57,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:39:57,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:39:57,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:39:57,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:39:57,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:39:57,470 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 02:39:57,490 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:39:57,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:39:57,491 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:39:57,492 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:39:57,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:39:57,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:39:57,492 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:39:57,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:39:57,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:39:57,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:39:57,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:39:57,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:39:57,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:39:57,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:39:57,494 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:39:57,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:39:57,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:39:57,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:39:57,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:39:57,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:39:57,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:39:57,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:39:57,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:39:57,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:39:57,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:39:57,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:39:57,498 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:39:57,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:39:57,500 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:39:57,500 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-08 02:39:57,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:39:57,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:39:57,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:39:57,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:39:57,765 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:39:57,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c [2022-04-08 02:39:57,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d26f55f/6e5a789fe76b40e4bca84a3bee9c447d/FLAGfce5d9047 [2022-04-08 02:39:58,183 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:39:58,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c [2022-04-08 02:39:58,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d26f55f/6e5a789fe76b40e4bca84a3bee9c447d/FLAGfce5d9047 [2022-04-08 02:39:58,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d26f55f/6e5a789fe76b40e4bca84a3bee9c447d [2022-04-08 02:39:58,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:39:58,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:39:58,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:39:58,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:39:58,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:39:58,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:39:58" (1/1) ... [2022-04-08 02:39:58,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c6bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:58, skipping insertion in model container [2022-04-08 02:39:58,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:39:58" (1/1) ... [2022-04-08 02:39:58,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:39:58,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:39:58,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c[458,471] [2022-04-08 02:39:58,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:39:58,463 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:39:58,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c[458,471] [2022-04-08 02:39:58,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:39:58,501 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:39:58,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:58 WrapperNode [2022-04-08 02:39:58,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:39:58,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:39:58,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:39:58,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:39:58,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:58" (1/1) ... [2022-04-08 02:39:58,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:58" (1/1) ... [2022-04-08 02:39:58,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:58" (1/1) ... [2022-04-08 02:39:58,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:58" (1/1) ... [2022-04-08 02:39:58,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:58" (1/1) ... [2022-04-08 02:39:58,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:58" (1/1) ... [2022-04-08 02:39:58,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:58" (1/1) ... [2022-04-08 02:39:58,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:39:58,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:39:58,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:39:58,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:39:58,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:58" (1/1) ... [2022-04-08 02:39:58,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:39:58,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:39:58,559 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-08 02:39:58,599 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-08 02:39:58,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:39:58,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:39:58,618 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:39:58,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 02:39:58,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 02:39:58,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:39:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:39:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:39:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:39:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:39:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 02:39:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 02:39:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 02:39:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:39:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:39:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:39:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:39:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:39:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:39:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:39:58,677 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:39:58,678 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:39:58,801 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:39:58,807 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:39:58,807 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:39:58,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:39:58 BoogieIcfgContainer [2022-04-08 02:39:58,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:39:58,810 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:39:58,810 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:39:58,811 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:39:58,817 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:39:58" (1/1) ... [2022-04-08 02:39:58,819 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:39:58,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:39:58 BasicIcfg [2022-04-08 02:39:58,860 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:39:58,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:39:58,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:39:58,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:39:58,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:39:58" (1/4) ... [2022-04-08 02:39:58,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d36861e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:39:58, skipping insertion in model container [2022-04-08 02:39:58,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:39:58" (2/4) ... [2022-04-08 02:39:58,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d36861e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:39:58, skipping insertion in model container [2022-04-08 02:39:58,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:39:58" (3/4) ... [2022-04-08 02:39:58,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d36861e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:39:58, skipping insertion in model container [2022-04-08 02:39:58,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:39:58" (4/4) ... [2022-04-08 02:39:58,896 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.cqvasr [2022-04-08 02:39:58,900 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:39:58,901 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:39:58,956 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:39:58,963 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-08 02:39:58,963 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:39:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:39:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:39:58,990 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:39:58,991 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:39:58,991 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:39:58,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:39:58,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1187991702, now seen corresponding path program 1 times [2022-04-08 02:39:59,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:39:59,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768283009] [2022-04-08 02:39:59,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:39:59,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:39:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:59,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:39:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:59,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-08 02:39:59,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-08 02:39:59,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-08 02:39:59,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 02:39:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:59,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-08 02:39:59,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:59,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:59,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-08 02:39:59,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 02:39:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:59,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-08 02:39:59,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:59,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:59,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-08 02:39:59,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 02:39:59,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-08 02:39:59,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-08 02:39:59,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-08 02:39:59,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-08 02:39:59,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {32#true} is VALID [2022-04-08 02:39:59,188 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-08 02:39:59,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-08 02:39:59,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:59,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:59,189 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-08 02:39:59,190 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {32#true} is VALID [2022-04-08 02:39:59,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {32#true} is VALID [2022-04-08 02:39:59,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} [76] L7-->L7-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:59,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:59,191 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#false} is VALID [2022-04-08 02:39:59,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {33#false} is VALID [2022-04-08 02:39:59,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:59,192 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {33#false} is VALID [2022-04-08 02:39:59,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33#false} is VALID [2022-04-08 02:39:59,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:59,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-08 02:39:59,193 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-08 02:39:59,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:39:59,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768283009] [2022-04-08 02:39:59,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768283009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:39:59,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:39:59,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 02:39:59,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297516802] [2022-04-08 02:39:59,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:39:59,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 02:39:59,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:39:59,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:39:59,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:39:59,239 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 02:39:59,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:39:59,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 02:39:59,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:39:59,264 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:39:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:59,490 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 02:39:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 02:39:59,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 02:39:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:39:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:39:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 02:39:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:39:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 02:39:59,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-08 02:39:59,596 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-08 02:39:59,606 INFO L225 Difference]: With dead ends: 51 [2022-04-08 02:39:59,607 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 02:39:59,610 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:39:59,616 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:39:59,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:39:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 02:39:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 02:39:59,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:39:59,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 02:39:59,661 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 02:39:59,661 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 02:39:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:59,672 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 02:39:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 02:39:59,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:59,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:59,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 02:39:59,674 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 02:39:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:39:59,676 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 02:39:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 02:39:59,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:39:59,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:39:59,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:39:59,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:39:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 02:39:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 02:39:59,681 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-08 02:39:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:39:59,681 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 02:39:59,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 02:39:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 02:39:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 02:39:59,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:39:59,682 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:39:59,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:39:59,686 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:39:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:39:59,687 INFO L85 PathProgramCache]: Analyzing trace with hash 793962506, now seen corresponding path program 1 times [2022-04-08 02:39:59,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:39:59,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791748939] [2022-04-08 02:39:59,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:39:59,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:39:59,742 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:39:59,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184991910] [2022-04-08 02:39:59,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:39:59,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:39:59,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:39:59,759 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-08 02:39:59,761 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-08 02:39:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:59,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 02:39:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:39:59,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:39:59,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:59,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {202#true} is VALID [2022-04-08 02:39:59,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:59,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:59,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:59,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {202#true} is VALID [2022-04-08 02:39:59,991 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-08 02:39:59,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {202#true} is VALID [2022-04-08 02:39:59,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:59,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:59,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-08 02:39:59,992 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-08 02:39:59,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {202#true} is VALID [2022-04-08 02:39:59,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:59,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#true} is VALID [2022-04-08 02:39:59,998 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {202#true} is VALID [2022-04-08 02:39:59,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:00,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:00,001 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:40:00,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:40:00,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {203#false} is VALID [2022-04-08 02:40:00,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#false} is VALID [2022-04-08 02:40:00,004 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-08 02:40:00,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 02:40:00,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:40:00,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791748939] [2022-04-08 02:40:00,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:40:00,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184991910] [2022-04-08 02:40:00,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184991910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:40:00,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:40:00,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 02:40:00,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45248183] [2022-04-08 02:40:00,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:40:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 02:40:00,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:40:00,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 02:40:00,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:00,030 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:40:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:40:00,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:40:00,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:40:00,031 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 02:40:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:00,259 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 02:40:00,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:40:00,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 02:40:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:40:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 02:40:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 02:40:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 02:40:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 02:40:00,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 02:40:00,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:00,305 INFO L225 Difference]: With dead ends: 35 [2022-04-08 02:40:00,306 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 02:40:00,306 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 02:40:00,308 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:40:00,309 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:40:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 02:40:00,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 02:40:00,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:40:00,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:40:00,328 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:40:00,329 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:40:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:00,334 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 02:40:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 02:40:00,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:00,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:00,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 02:40:00,336 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 02:40:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:00,340 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 02:40:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 02:40:00,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:00,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:00,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:40:00,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:40:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:40:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-08 02:40:00,343 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-08 02:40:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:40:00,343 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-08 02:40:00,344 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 02:40:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 02:40:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 02:40:00,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:40:00,345 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:40:00,369 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-08 02:40:00,569 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-08 02:40:00,569 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:40:00,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:40:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash -503871754, now seen corresponding path program 1 times [2022-04-08 02:40:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:40:00,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925726598] [2022-04-08 02:40:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:40:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:40:00,588 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:40:00,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2612695] [2022-04-08 02:40:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:40:00,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:00,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:40:00,590 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-08 02:40:00,619 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-08 02:40:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:40:00,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 02:40:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:40:00,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:40:00,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:00,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {434#true} is VALID [2022-04-08 02:40:00,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:00,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:00,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:00,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {434#true} is VALID [2022-04-08 02:40:00,868 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:40:00,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {434#true} is VALID [2022-04-08 02:40:00,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:00,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:00,869 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:40:00,869 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:40:00,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {434#true} is VALID [2022-04-08 02:40:00,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:00,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:00,870 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:40:00,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:00,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:00,871 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {434#true} is VALID [2022-04-08 02:40:00,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {434#true} is VALID [2022-04-08 02:40:00,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:00,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:00,873 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {487#(and (= main_~x~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:00,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-08 02:40:00,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-08 02:40:00,876 INFO L272 TraceCheckUtils]: 25: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:40:00,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:40:00,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-08 02:40:00,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-08 02:40:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 02:40:00,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:40:01,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-08 02:40:01,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {435#false} is VALID [2022-04-08 02:40:01,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:40:01,140 INFO L272 TraceCheckUtils]: 25: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:40:01,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 02:40:01,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 02:40:01,240 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 02:40:01,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:01,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:01,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {434#true} is VALID [2022-04-08 02:40:01,241 INFO L272 TraceCheckUtils]: 18: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {434#true} is VALID [2022-04-08 02:40:01,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 02:40:01,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {536#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 02:40:01,242 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:40:01,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:01,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:01,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {434#true} is VALID [2022-04-08 02:40:01,243 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:40:01,243 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:40:01,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:01,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:01,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {434#true} is VALID [2022-04-08 02:40:01,244 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {434#true} is VALID [2022-04-08 02:40:01,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {434#true} is VALID [2022-04-08 02:40:01,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:01,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:01,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:01,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {434#true} is VALID [2022-04-08 02:40:01,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#true} is VALID [2022-04-08 02:40:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 02:40:01,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:40:01,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925726598] [2022-04-08 02:40:01,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:40:01,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2612695] [2022-04-08 02:40:01,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2612695] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 02:40:01,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:40:01,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 02:40:01,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392991438] [2022-04-08 02:40:01,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:40:01,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 02:40:01,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:40:01,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:40:01,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:01,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:40:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:40:01,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:40:01,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 02:40:01,326 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:40:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:01,445 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 02:40:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:40:01,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 02:40:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:40:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:40:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 02:40:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:40:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 02:40:01,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 02:40:01,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:01,533 INFO L225 Difference]: With dead ends: 37 [2022-04-08 02:40:01,534 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 02:40:01,534 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 02:40:01,535 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:40:01,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 02:40:01,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 02:40:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 02:40:01,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:40:01,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:40:01,542 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:40:01,542 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:40:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:01,544 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 02:40:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 02:40:01,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:01,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:01,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 02:40:01,546 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 02:40:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:01,547 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 02:40:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 02:40:01,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:01,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:01,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:40:01,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:40:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 02:40:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-08 02:40:01,550 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-08 02:40:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:40:01,550 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-08 02:40:01,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 02:40:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 02:40:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 02:40:01,551 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:40:01,551 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 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] [2022-04-08 02:40:01,574 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-08 02:40:01,774 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-08 02:40:01,775 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:40:01,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:40:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1285656823, now seen corresponding path program 1 times [2022-04-08 02:40:01,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:40:01,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370933711] [2022-04-08 02:40:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:40:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:40:01,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:40:01,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425495965] [2022-04-08 02:40:01,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:40:01,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:01,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:40:01,807 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-08 02:40:01,808 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-08 02:40:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:40:01,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 02:40:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:40:01,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:40:02,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {784#true} is VALID [2022-04-08 02:40:02,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {784#true} is VALID [2022-04-08 02:40:02,173 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-08 02:40:02,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {784#true} is VALID [2022-04-08 02:40:02,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,173 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-08 02:40:02,173 INFO L272 TraceCheckUtils]: 11: Hoare triple {784#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-08 02:40:02,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {784#true} is VALID [2022-04-08 02:40:02,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,174 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {784#true} is VALID [2022-04-08 02:40:02,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:02,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:02,179 INFO L272 TraceCheckUtils]: 18: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {784#true} is VALID [2022-04-08 02:40:02,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {784#true} is VALID [2022-04-08 02:40:02,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,180 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {784#true} {837#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:02,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 02:40:02,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 02:40:02,181 INFO L272 TraceCheckUtils]: 25: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {784#true} is VALID [2022-04-08 02:40:02,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {784#true} is VALID [2022-04-08 02:40:02,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,183 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {784#true} {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 02:40:02,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 02:40:02,184 INFO L272 TraceCheckUtils]: 31: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {784#true} is VALID [2022-04-08 02:40:02,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {784#true} is VALID [2022-04-08 02:40:02,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#true} is VALID [2022-04-08 02:40:02,185 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {784#true} {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 02:40:02,186 INFO L272 TraceCheckUtils]: 36: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:40:02,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {900#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:40:02,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-08 02:40:02,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {785#false} is VALID [2022-04-08 02:40:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 02:40:02,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:40:02,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:40:02,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370933711] [2022-04-08 02:40:02,567 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:40:02,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425495965] [2022-04-08 02:40:02,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425495965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:40:02,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:40:02,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 02:40:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945482918] [2022-04-08 02:40:02,568 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:40:02,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 02:40:02,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:40:02,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 02:40:02,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:02,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 02:40:02,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:40:02,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 02:40:02,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 02:40:02,593 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 02:40:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:02,843 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 02:40:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 02:40:02,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 02:40:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:40:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 02:40:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 02:40:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 02:40:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 02:40:02,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-08 02:40:02,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:02,885 INFO L225 Difference]: With dead ends: 42 [2022-04-08 02:40:02,885 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 02:40:02,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 02:40:02,886 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:40:02,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:40:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 02:40:02,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 02:40:02,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:40:02,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:40:02,900 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:40:02,900 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:40:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:02,901 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 02:40:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 02:40:02,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:02,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:02,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 02:40:02,902 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 02:40:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:02,904 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 02:40:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 02:40:02,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:02,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:02,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:40:02,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:40:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 02:40:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-08 02:40:02,906 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-08 02:40:02,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:40:02,906 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-08 02:40:02,906 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 02:40:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 02:40:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 02:40:02,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:40:02,907 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:40:02,926 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-08 02:40:03,126 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-08 02:40:03,127 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:40:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:40:03,127 INFO L85 PathProgramCache]: Analyzing trace with hash -542323485, now seen corresponding path program 2 times [2022-04-08 02:40:03,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:40:03,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195514414] [2022-04-08 02:40:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:40:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:40:03,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:40:03,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302558857] [2022-04-08 02:40:03,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 02:40:03,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:03,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:40:03,142 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-08 02:40:03,143 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-08 02:40:03,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 02:40:03,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:40:03,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 02:40:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:40:03,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:40:03,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {1160#true} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1160#true} is VALID [2022-04-08 02:40:03,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {1160#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1160#true} is VALID [2022-04-08 02:40:03,494 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1160#true} is VALID [2022-04-08 02:40:03,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1160#true} is VALID [2022-04-08 02:40:03,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,495 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1160#true} is VALID [2022-04-08 02:40:03,495 INFO L272 TraceCheckUtils]: 11: Hoare triple {1160#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1160#true} is VALID [2022-04-08 02:40:03,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1160#true} is VALID [2022-04-08 02:40:03,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,495 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1160#true} is VALID [2022-04-08 02:40:03,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {1160#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:03,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:03,497 INFO L272 TraceCheckUtils]: 18: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1160#true} is VALID [2022-04-08 02:40:03,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1160#true} is VALID [2022-04-08 02:40:03,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,498 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1160#true} {1213#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:03,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 02:40:03,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(and (= main_~y~0 1) (= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 02:40:03,500 INFO L272 TraceCheckUtils]: 25: Hoare triple {1235#(and (= main_~y~0 1) (= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1160#true} is VALID [2022-04-08 02:40:03,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1160#true} is VALID [2022-04-08 02:40:03,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,501 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1160#true} {1235#(and (= main_~y~0 1) (= main_~c~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 02:40:03,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {1235#(and (= main_~y~0 1) (= main_~c~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-08 02:40:03,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-08 02:40:03,502 INFO L272 TraceCheckUtils]: 32: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1160#true} is VALID [2022-04-08 02:40:03,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1160#true} is VALID [2022-04-08 02:40:03,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,503 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1160#true} {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-08 02:40:03,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-08 02:40:03,504 INFO L272 TraceCheckUtils]: 38: Hoare triple {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1160#true} is VALID [2022-04-08 02:40:03,504 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1160#true} is VALID [2022-04-08 02:40:03,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {1160#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {1160#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#true} is VALID [2022-04-08 02:40:03,504 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1160#true} {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-08 02:40:03,505 INFO L272 TraceCheckUtils]: 43: Hoare triple {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:40:03,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:40:03,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1161#false} is VALID [2022-04-08 02:40:03,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1161#false} is VALID [2022-04-08 02:40:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 02:40:03,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:40:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:40:03,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195514414] [2022-04-08 02:40:03,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:40:03,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302558857] [2022-04-08 02:40:03,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302558857] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:40:03,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:40:03,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 02:40:03,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459225684] [2022-04-08 02:40:03,792 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:40:03,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 02:40:03,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:40:03,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 02:40:03,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:03,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 02:40:03,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:40:03,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 02:40:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 02:40:03,820 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 02:40:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:04,061 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 02:40:04,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 02:40:04,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 02:40:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:40:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 02:40:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 02:40:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 02:40:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 02:40:04,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-08 02:40:04,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:04,099 INFO L225 Difference]: With dead ends: 45 [2022-04-08 02:40:04,099 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 02:40:04,100 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 02:40:04,100 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:40:04,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:40:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 02:40:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 02:40:04,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:40:04,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 02:40:04,123 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 02:40:04,124 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 02:40:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:04,128 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 02:40:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 02:40:04,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:04,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:04,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 02:40:04,130 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 02:40:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:04,132 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 02:40:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 02:40:04,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:04,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:04,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:40:04,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:40:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 02:40:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-08 02:40:04,137 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-08 02:40:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:40:04,137 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-08 02:40:04,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 02:40:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 02:40:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 02:40:04,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:40:04,143 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:40:04,150 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-08 02:40:04,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:04,344 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:40:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:40:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2094100617, now seen corresponding path program 3 times [2022-04-08 02:40:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:40:04,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727068668] [2022-04-08 02:40:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:40:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:40:04,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:40:04,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227222877] [2022-04-08 02:40:04,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-08 02:40:04,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:04,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:40:04,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:40:04,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 02:40:04,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-08 02:40:04,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:40:04,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 02:40:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:40:04,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:40:04,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1574#true} is VALID [2022-04-08 02:40:04,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {1574#true} is VALID [2022-04-08 02:40:04,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1574#true} is VALID [2022-04-08 02:40:04,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1574#true} is VALID [2022-04-08 02:40:04,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,826 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1574#true} {1574#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1574#true} is VALID [2022-04-08 02:40:04,827 INFO L272 TraceCheckUtils]: 11: Hoare triple {1574#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1574#true} is VALID [2022-04-08 02:40:04,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {1574#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1574#true} is VALID [2022-04-08 02:40:04,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {1574#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,827 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1574#true} {1574#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {1574#true} is VALID [2022-04-08 02:40:04,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {1574#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:04,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {1627#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:04,828 INFO L272 TraceCheckUtils]: 18: Hoare triple {1627#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-08 02:40:04,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-08 02:40:04,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,828 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1574#true} {1627#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:04,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 02:40:04,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 02:40:04,831 INFO L272 TraceCheckUtils]: 25: Hoare triple {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-08 02:40:04,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-08 02:40:04,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,831 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1574#true} {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 02:40:04,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:40:04,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:40:04,832 INFO L272 TraceCheckUtils]: 32: Hoare triple {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-08 02:40:04,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-08 02:40:04,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,833 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1574#true} {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:40:04,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 02:40:04,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 02:40:04,834 INFO L272 TraceCheckUtils]: 39: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-08 02:40:04,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-08 02:40:04,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,838 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1574#true} {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 02:40:04,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 02:40:04,839 INFO L272 TraceCheckUtils]: 45: Hoare triple {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1574#true} is VALID [2022-04-08 02:40:04,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {1574#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1574#true} is VALID [2022-04-08 02:40:04,839 INFO L290 TraceCheckUtils]: 47: Hoare triple {1574#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,839 INFO L290 TraceCheckUtils]: 48: Hoare triple {1574#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#true} is VALID [2022-04-08 02:40:04,840 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1574#true} {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 02:40:04,840 INFO L272 TraceCheckUtils]: 50: Hoare triple {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1734#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:40:04,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {1734#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1738#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:40:04,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {1738#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-08 02:40:04,841 INFO L290 TraceCheckUtils]: 53: Hoare triple {1575#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1575#false} is VALID [2022-04-08 02:40:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 02:40:04,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:40:05,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:40:05,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727068668] [2022-04-08 02:40:05,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:40:05,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227222877] [2022-04-08 02:40:05,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227222877] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:40:05,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:40:05,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 02:40:05,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732588909] [2022-04-08 02:40:05,132 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:40:05,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 02:40:05,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:40:05,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 02:40:05,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:05,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 02:40:05,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:40:05,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 02:40:05,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 02:40:05,165 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 02:40:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:05,498 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 02:40:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 02:40:05,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 02:40:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:40:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 02:40:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 02:40:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 02:40:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 02:40:05,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-08 02:40:05,537 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-08 02:40:05,538 INFO L225 Difference]: With dead ends: 48 [2022-04-08 02:40:05,538 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 02:40:05,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 02:40:05,538 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:40:05,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:40:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 02:40:05,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 02:40:05,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:40:05,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 02:40:05,549 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 02:40:05,549 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 02:40:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:05,551 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 02:40:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 02:40:05,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:05,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:05,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-08 02:40:05,551 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-08 02:40:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:05,553 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 02:40:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 02:40:05,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:05,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:05,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:40:05,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:40:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 02:40:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-08 02:40:05,554 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-08 02:40:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:40:05,555 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-08 02:40:05,555 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 02:40:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 02:40:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 02:40:05,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:40:05,556 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:40:05,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 02:40:05,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:05,760 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:40:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:40:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash -826507677, now seen corresponding path program 4 times [2022-04-08 02:40:05,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:40:05,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410537466] [2022-04-08 02:40:05,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:40:05,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:40:05,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:40:05,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [713559839] [2022-04-08 02:40:05,790 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 02:40:05,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:05,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:40:05,791 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:40:05,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 02:40:05,826 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 02:40:05,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:40:05,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 02:40:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:40:05,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:40:06,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {2026#true} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2026#true} is VALID [2022-04-08 02:40:06,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2026#true} is VALID [2022-04-08 02:40:06,142 INFO L272 TraceCheckUtils]: 6: Hoare triple {2026#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2026#true} is VALID [2022-04-08 02:40:06,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {2026#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2026#true} is VALID [2022-04-08 02:40:06,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {2026#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {2026#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2026#true} {2026#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2026#true} is VALID [2022-04-08 02:40:06,142 INFO L272 TraceCheckUtils]: 11: Hoare triple {2026#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2026#true} is VALID [2022-04-08 02:40:06,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {2026#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2026#true} is VALID [2022-04-08 02:40:06,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {2026#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {2026#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,142 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2026#true} {2026#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2026#true} is VALID [2022-04-08 02:40:06,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {2026#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:06,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {2079#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:06,144 INFO L272 TraceCheckUtils]: 18: Hoare triple {2079#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2026#true} is VALID [2022-04-08 02:40:06,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {2026#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2026#true} is VALID [2022-04-08 02:40:06,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {2026#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {2026#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,151 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2026#true} {2079#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:06,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {2079#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:40:06,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:40:06,152 INFO L272 TraceCheckUtils]: 25: Hoare triple {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2026#true} is VALID [2022-04-08 02:40:06,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {2026#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2026#true} is VALID [2022-04-08 02:40:06,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {2026#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {2026#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,152 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2026#true} {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:40:06,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:40:06,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:40:06,153 INFO L272 TraceCheckUtils]: 32: Hoare triple {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2026#true} is VALID [2022-04-08 02:40:06,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {2026#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2026#true} is VALID [2022-04-08 02:40:06,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {2026#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {2026#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,154 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2026#true} {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:40:06,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 02:40:06,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 02:40:06,155 INFO L272 TraceCheckUtils]: 39: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2026#true} is VALID [2022-04-08 02:40:06,155 INFO L290 TraceCheckUtils]: 40: Hoare triple {2026#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2026#true} is VALID [2022-04-08 02:40:06,155 INFO L290 TraceCheckUtils]: 41: Hoare triple {2026#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {2026#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,156 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2026#true} {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 02:40:06,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 02:40:06,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 02:40:06,156 INFO L272 TraceCheckUtils]: 46: Hoare triple {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2026#true} is VALID [2022-04-08 02:40:06,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {2026#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2026#true} is VALID [2022-04-08 02:40:06,157 INFO L290 TraceCheckUtils]: 48: Hoare triple {2026#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {2026#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,158 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2026#true} {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 02:40:06,158 INFO L290 TraceCheckUtils]: 51: Hoare triple {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 02:40:06,159 INFO L272 TraceCheckUtils]: 52: Hoare triple {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2026#true} is VALID [2022-04-08 02:40:06,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {2026#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2026#true} is VALID [2022-04-08 02:40:06,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {2026#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {2026#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2026#true} is VALID [2022-04-08 02:40:06,159 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2026#true} {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 02:40:06,160 INFO L272 TraceCheckUtils]: 57: Hoare triple {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2208#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:40:06,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {2208#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2212#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:40:06,160 INFO L290 TraceCheckUtils]: 59: Hoare triple {2212#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2027#false} is VALID [2022-04-08 02:40:06,161 INFO L290 TraceCheckUtils]: 60: Hoare triple {2027#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2027#false} is VALID [2022-04-08 02:40:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 02:40:06,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:40:06,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:40:06,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410537466] [2022-04-08 02:40:06,415 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:40:06,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713559839] [2022-04-08 02:40:06,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713559839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:40:06,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:40:06,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 02:40:06,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015100928] [2022-04-08 02:40:06,415 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:40:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 02:40:06,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:40:06,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 02:40:06,445 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-08 02:40:06,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 02:40:06,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:40:06,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 02:40:06,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 02:40:06,446 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 02:40:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:06,859 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-08 02:40:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 02:40:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 02:40:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:40:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 02:40:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 02:40:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 02:40:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 02:40:06,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-08 02:40:06,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:06,906 INFO L225 Difference]: With dead ends: 51 [2022-04-08 02:40:06,906 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 02:40:06,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 02:40:06,908 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 02:40:06,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 02:40:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 02:40:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 02:40:06,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:40:06,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:40:06,928 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:40:06,928 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:40:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:06,930 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 02:40:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 02:40:06,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:06,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:06,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 02:40:06,930 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 02:40:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:06,931 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 02:40:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 02:40:06,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:06,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:06,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:40:06,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:40:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 02:40:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-08 02:40:06,933 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-08 02:40:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:40:06,934 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-08 02:40:06,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 02:40:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 02:40:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 02:40:06,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:40:06,935 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:40:06,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 02:40:07,152 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:07,153 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:40:07,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:40:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash -170119689, now seen corresponding path program 5 times [2022-04-08 02:40:07,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:40:07,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814781734] [2022-04-08 02:40:07,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:40:07,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:40:07,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:40:07,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1639878545] [2022-04-08 02:40:07,164 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-08 02:40:07,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:07,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:40:07,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:40:07,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 02:40:07,671 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-08 02:40:07,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:40:07,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 02:40:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:40:07,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:40:08,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {2516#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {2516#true} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {2516#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2516#true} {2516#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {2516#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {2516#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {2516#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {2516#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {2516#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {2516#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2516#true} {2516#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L272 TraceCheckUtils]: 11: Hoare triple {2516#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2516#true} is VALID [2022-04-08 02:40:08,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {2516#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2516#true} is VALID [2022-04-08 02:40:08,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {2516#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {2516#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,007 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2516#true} {2516#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {2516#true} is VALID [2022-04-08 02:40:08,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {2516#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:08,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {2569#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:08,008 INFO L272 TraceCheckUtils]: 18: Hoare triple {2569#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2516#true} is VALID [2022-04-08 02:40:08,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {2516#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2516#true} is VALID [2022-04-08 02:40:08,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {2516#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {2516#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,012 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2516#true} {2569#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:08,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {2569#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 02:40:08,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 02:40:08,013 INFO L272 TraceCheckUtils]: 25: Hoare triple {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2516#true} is VALID [2022-04-08 02:40:08,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {2516#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2516#true} is VALID [2022-04-08 02:40:08,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {2516#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {2516#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,013 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2516#true} {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 02:40:08,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 02:40:08,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 02:40:08,014 INFO L272 TraceCheckUtils]: 32: Hoare triple {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2516#true} is VALID [2022-04-08 02:40:08,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {2516#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2516#true} is VALID [2022-04-08 02:40:08,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {2516#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {2516#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,015 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2516#true} {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 02:40:08,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 02:40:08,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 02:40:08,016 INFO L272 TraceCheckUtils]: 39: Hoare triple {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2516#true} is VALID [2022-04-08 02:40:08,016 INFO L290 TraceCheckUtils]: 40: Hoare triple {2516#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2516#true} is VALID [2022-04-08 02:40:08,016 INFO L290 TraceCheckUtils]: 41: Hoare triple {2516#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {2516#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,016 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2516#true} {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 02:40:08,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:40:08,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:40:08,017 INFO L272 TraceCheckUtils]: 46: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2516#true} is VALID [2022-04-08 02:40:08,017 INFO L290 TraceCheckUtils]: 47: Hoare triple {2516#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2516#true} is VALID [2022-04-08 02:40:08,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {2516#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {2516#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,018 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2516#true} {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:40:08,018 INFO L290 TraceCheckUtils]: 51: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 02:40:08,018 INFO L290 TraceCheckUtils]: 52: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 02:40:08,019 INFO L272 TraceCheckUtils]: 53: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2516#true} is VALID [2022-04-08 02:40:08,019 INFO L290 TraceCheckUtils]: 54: Hoare triple {2516#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2516#true} is VALID [2022-04-08 02:40:08,020 INFO L290 TraceCheckUtils]: 55: Hoare triple {2516#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,024 INFO L290 TraceCheckUtils]: 56: Hoare triple {2516#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,025 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2516#true} {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 02:40:08,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 02:40:08,026 INFO L272 TraceCheckUtils]: 59: Hoare triple {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2516#true} is VALID [2022-04-08 02:40:08,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {2516#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2516#true} is VALID [2022-04-08 02:40:08,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {2516#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,026 INFO L290 TraceCheckUtils]: 62: Hoare triple {2516#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2516#true} is VALID [2022-04-08 02:40:08,028 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2516#true} {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 02:40:08,028 INFO L272 TraceCheckUtils]: 64: Hoare triple {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:40:08,029 INFO L290 TraceCheckUtils]: 65: Hoare triple {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:40:08,029 INFO L290 TraceCheckUtils]: 66: Hoare triple {2724#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2517#false} is VALID [2022-04-08 02:40:08,029 INFO L290 TraceCheckUtils]: 67: Hoare triple {2517#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2517#false} is VALID [2022-04-08 02:40:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 02:40:08,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:40:08,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:40:08,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814781734] [2022-04-08 02:40:08,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:40:08,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639878545] [2022-04-08 02:40:08,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639878545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:40:08,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:40:08,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 02:40:08,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233872472] [2022-04-08 02:40:08,268 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:40:08,268 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 02:40:08,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:40:08,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 02:40:08,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:08,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 02:40:08,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:40:08,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 02:40:08,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 02:40:08,302 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 02:40:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:08,848 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 02:40:08,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 02:40:08,848 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 02:40:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:40:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 02:40:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 02:40:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 02:40:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 02:40:08,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-08 02:40:08,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:08,897 INFO L225 Difference]: With dead ends: 54 [2022-04-08 02:40:08,897 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 02:40:08,897 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 02:40:08,898 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 02:40:08,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 02:40:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 02:40:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-08 02:40:08,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:40:08,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:40:08,917 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:40:08,917 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:40:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:08,918 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 02:40:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 02:40:08,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:08,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:08,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-08 02:40:08,919 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-08 02:40:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:08,920 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 02:40:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 02:40:08,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:08,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:08,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:40:08,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:40:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 02:40:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-08 02:40:08,922 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-08 02:40:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:40:08,922 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-08 02:40:08,922 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 02:40:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 02:40:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 02:40:08,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:40:08,923 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:40:08,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 02:40:09,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:09,130 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:40:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:40:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1505202147, now seen corresponding path program 6 times [2022-04-08 02:40:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:40:09,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250479257] [2022-04-08 02:40:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:40:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:40:09,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:40:09,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139014269] [2022-04-08 02:40:09,153 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 02:40:09,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:09,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:40:09,159 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:40:09,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 02:40:09,683 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 02:40:09,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:40:09,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 02:40:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:40:09,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:40:10,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {3044#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {3044#true} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3044#true} is VALID [2022-04-08 02:40:10,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {3044#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {3044#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {3044#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {3044#true} is VALID [2022-04-08 02:40:10,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {3044#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3044#true} is VALID [2022-04-08 02:40:10,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {3044#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3044#true} is VALID [2022-04-08 02:40:10,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {3044#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {3044#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3044#true} {3044#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3044#true} is VALID [2022-04-08 02:40:10,100 INFO L272 TraceCheckUtils]: 11: Hoare triple {3044#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3044#true} is VALID [2022-04-08 02:40:10,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {3044#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3044#true} is VALID [2022-04-08 02:40:10,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {3044#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {3044#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,100 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3044#true} {3044#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3044#true} is VALID [2022-04-08 02:40:10,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {3044#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:10,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {3097#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:10,101 INFO L272 TraceCheckUtils]: 18: Hoare triple {3097#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3044#true} is VALID [2022-04-08 02:40:10,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {3044#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3044#true} is VALID [2022-04-08 02:40:10,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {3044#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {3044#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,102 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3044#true} {3097#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:40:10,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {3097#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:40:10,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:40:10,103 INFO L272 TraceCheckUtils]: 25: Hoare triple {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3044#true} is VALID [2022-04-08 02:40:10,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {3044#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3044#true} is VALID [2022-04-08 02:40:10,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {3044#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {3044#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,103 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3044#true} {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:40:10,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 02:40:10,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 02:40:10,104 INFO L272 TraceCheckUtils]: 32: Hoare triple {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3044#true} is VALID [2022-04-08 02:40:10,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {3044#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3044#true} is VALID [2022-04-08 02:40:10,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {3044#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {3044#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,105 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3044#true} {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 02:40:10,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 02:40:10,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 02:40:10,106 INFO L272 TraceCheckUtils]: 39: Hoare triple {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3044#true} is VALID [2022-04-08 02:40:10,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {3044#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3044#true} is VALID [2022-04-08 02:40:10,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {3044#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {3044#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,107 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3044#true} {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 02:40:10,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3185#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 02:40:10,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#(and (= main_~y~0 4) (= main_~c~0 4))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3185#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 02:40:10,108 INFO L272 TraceCheckUtils]: 46: Hoare triple {3185#(and (= main_~y~0 4) (= main_~c~0 4))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3044#true} is VALID [2022-04-08 02:40:10,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {3044#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3044#true} is VALID [2022-04-08 02:40:10,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {3044#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {3044#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,108 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3044#true} {3185#(and (= main_~y~0 4) (= main_~c~0 4))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3185#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 02:40:10,109 INFO L290 TraceCheckUtils]: 51: Hoare triple {3185#(and (= main_~y~0 4) (= main_~c~0 4))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 02:40:10,109 INFO L290 TraceCheckUtils]: 52: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 02:40:10,109 INFO L272 TraceCheckUtils]: 53: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3044#true} is VALID [2022-04-08 02:40:10,109 INFO L290 TraceCheckUtils]: 54: Hoare triple {3044#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3044#true} is VALID [2022-04-08 02:40:10,109 INFO L290 TraceCheckUtils]: 55: Hoare triple {3044#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {3044#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,110 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3044#true} {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 02:40:10,110 INFO L290 TraceCheckUtils]: 58: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 02:40:10,110 INFO L290 TraceCheckUtils]: 59: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 02:40:10,111 INFO L272 TraceCheckUtils]: 60: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3044#true} is VALID [2022-04-08 02:40:10,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {3044#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3044#true} is VALID [2022-04-08 02:40:10,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {3044#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,111 INFO L290 TraceCheckUtils]: 63: Hoare triple {3044#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,111 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3044#true} {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 02:40:10,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 02:40:10,112 INFO L272 TraceCheckUtils]: 66: Hoare triple {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3044#true} is VALID [2022-04-08 02:40:10,112 INFO L290 TraceCheckUtils]: 67: Hoare triple {3044#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3044#true} is VALID [2022-04-08 02:40:10,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {3044#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,112 INFO L290 TraceCheckUtils]: 69: Hoare triple {3044#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3044#true} is VALID [2022-04-08 02:40:10,113 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3044#true} {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 02:40:10,113 INFO L272 TraceCheckUtils]: 71: Hoare triple {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {3270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:40:10,114 INFO L290 TraceCheckUtils]: 72: Hoare triple {3270#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:40:10,114 INFO L290 TraceCheckUtils]: 73: Hoare triple {3274#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3045#false} is VALID [2022-04-08 02:40:10,114 INFO L290 TraceCheckUtils]: 74: Hoare triple {3045#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3045#false} is VALID [2022-04-08 02:40:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 02:40:10,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:40:10,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:40:10,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250479257] [2022-04-08 02:40:10,382 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:40:10,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139014269] [2022-04-08 02:40:10,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139014269] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:40:10,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:40:10,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 02:40:10,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843669719] [2022-04-08 02:40:10,384 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:40:10,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-08 02:40:10,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:40:10,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 02:40:10,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:10,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 02:40:10,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:40:10,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 02:40:10,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 02:40:10,446 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 02:40:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:11,065 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 02:40:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 02:40:11,065 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-08 02:40:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:40:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 02:40:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-08 02:40:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 02:40:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-08 02:40:11,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-08 02:40:11,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:40:11,112 INFO L225 Difference]: With dead ends: 57 [2022-04-08 02:40:11,112 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 02:40:11,113 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-08 02:40:11,113 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 02:40:11,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 310 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 02:40:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 02:40:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 02:40:11,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:40:11,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 02:40:11,138 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 02:40:11,138 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 02:40:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:11,140 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 02:40:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 02:40:11,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:11,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:11,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-08 02:40:11,140 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-08 02:40:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:40:11,141 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 02:40:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 02:40:11,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:40:11,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:40:11,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:40:11,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:40:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 02:40:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-08 02:40:11,143 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-08 02:40:11,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:40:11,143 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-08 02:40:11,144 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 02:40:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 02:40:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 02:40:11,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:40:11,144 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:40:11,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 02:40:11,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 02:40:11,349 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:40:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:40:11,350 INFO L85 PathProgramCache]: Analyzing trace with hash 252865655, now seen corresponding path program 7 times [2022-04-08 02:40:11,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:40:11,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587260627] [2022-04-08 02:40:11,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:40:11,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:40:11,359 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:40:11,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [721134928] [2022-04-08 02:40:11,360 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-08 02:40:11,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:40:11,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:40:11,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:40:11,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 02:41:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:41:02,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 02:41:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:41:02,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:41:02,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {3610#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {3610#true} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3610#true} is VALID [2022-04-08 02:41:02,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {3610#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3610#true} {3610#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {3610#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {3610#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {3610#true} is VALID [2022-04-08 02:41:02,822 INFO L272 TraceCheckUtils]: 6: Hoare triple {3610#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3610#true} is VALID [2022-04-08 02:41:02,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {3610#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3610#true} is VALID [2022-04-08 02:41:02,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {3610#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {3610#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,822 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3610#true} {3610#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3610#true} is VALID [2022-04-08 02:41:02,822 INFO L272 TraceCheckUtils]: 11: Hoare triple {3610#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3610#true} is VALID [2022-04-08 02:41:02,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {3610#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3610#true} is VALID [2022-04-08 02:41:02,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {3610#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {3610#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,823 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3610#true} {3610#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {3610#true} is VALID [2022-04-08 02:41:02,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {3610#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {3663#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:41:02,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {3663#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3663#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:41:02,823 INFO L272 TraceCheckUtils]: 18: Hoare triple {3663#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3610#true} is VALID [2022-04-08 02:41:02,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {3610#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3610#true} is VALID [2022-04-08 02:41:02,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {3610#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {3610#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,824 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3610#true} {3663#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3663#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:41:02,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {3663#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:41:02,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:41:02,825 INFO L272 TraceCheckUtils]: 25: Hoare triple {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3610#true} is VALID [2022-04-08 02:41:02,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {3610#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3610#true} is VALID [2022-04-08 02:41:02,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {3610#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {3610#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,826 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3610#true} {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:41:02,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:41:02,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:41:02,828 INFO L272 TraceCheckUtils]: 32: Hoare triple {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3610#true} is VALID [2022-04-08 02:41:02,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {3610#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3610#true} is VALID [2022-04-08 02:41:02,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {3610#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {3610#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,829 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3610#true} {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:41:02,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3729#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:41:02,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {3729#(and (= main_~y~0 3) (= main_~c~0 3))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3729#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:41:02,829 INFO L272 TraceCheckUtils]: 39: Hoare triple {3729#(and (= main_~y~0 3) (= main_~c~0 3))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3610#true} is VALID [2022-04-08 02:41:02,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {3610#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3610#true} is VALID [2022-04-08 02:41:02,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {3610#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {3610#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,831 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3610#true} {3729#(and (= main_~y~0 3) (= main_~c~0 3))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3729#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:41:02,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {3729#(and (= main_~y~0 3) (= main_~c~0 3))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 02:41:02,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 02:41:02,832 INFO L272 TraceCheckUtils]: 46: Hoare triple {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3610#true} is VALID [2022-04-08 02:41:02,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {3610#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3610#true} is VALID [2022-04-08 02:41:02,832 INFO L290 TraceCheckUtils]: 48: Hoare triple {3610#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {3610#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,833 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3610#true} {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 02:41:02,833 INFO L290 TraceCheckUtils]: 51: Hoare triple {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 02:41:02,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 02:41:02,834 INFO L272 TraceCheckUtils]: 53: Hoare triple {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3610#true} is VALID [2022-04-08 02:41:02,834 INFO L290 TraceCheckUtils]: 54: Hoare triple {3610#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3610#true} is VALID [2022-04-08 02:41:02,834 INFO L290 TraceCheckUtils]: 55: Hoare triple {3610#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {3610#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,834 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3610#true} {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 02:41:02,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:41:02,835 INFO L290 TraceCheckUtils]: 59: Hoare triple {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:41:02,835 INFO L272 TraceCheckUtils]: 60: Hoare triple {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3610#true} is VALID [2022-04-08 02:41:02,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {3610#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3610#true} is VALID [2022-04-08 02:41:02,835 INFO L290 TraceCheckUtils]: 62: Hoare triple {3610#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,835 INFO L290 TraceCheckUtils]: 63: Hoare triple {3610#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,843 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3610#true} {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:41:02,844 INFO L290 TraceCheckUtils]: 65: Hoare triple {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 02:41:02,844 INFO L290 TraceCheckUtils]: 66: Hoare triple {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 02:41:02,844 INFO L272 TraceCheckUtils]: 67: Hoare triple {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3610#true} is VALID [2022-04-08 02:41:02,844 INFO L290 TraceCheckUtils]: 68: Hoare triple {3610#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3610#true} is VALID [2022-04-08 02:41:02,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {3610#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,845 INFO L290 TraceCheckUtils]: 70: Hoare triple {3610#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,845 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3610#true} {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 02:41:02,846 INFO L290 TraceCheckUtils]: 72: Hoare triple {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 02:41:02,846 INFO L272 TraceCheckUtils]: 73: Hoare triple {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3610#true} is VALID [2022-04-08 02:41:02,846 INFO L290 TraceCheckUtils]: 74: Hoare triple {3610#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3610#true} is VALID [2022-04-08 02:41:02,846 INFO L290 TraceCheckUtils]: 75: Hoare triple {3610#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,846 INFO L290 TraceCheckUtils]: 76: Hoare triple {3610#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3610#true} is VALID [2022-04-08 02:41:02,846 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3610#true} {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-08 02:41:02,847 INFO L272 TraceCheckUtils]: 78: Hoare triple {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {3858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:41:02,847 INFO L290 TraceCheckUtils]: 79: Hoare triple {3858#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:41:02,847 INFO L290 TraceCheckUtils]: 80: Hoare triple {3862#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3611#false} is VALID [2022-04-08 02:41:02,848 INFO L290 TraceCheckUtils]: 81: Hoare triple {3611#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3611#false} is VALID [2022-04-08 02:41:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-08 02:41:02,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:41:03,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:41:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587260627] [2022-04-08 02:41:03,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:41:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721134928] [2022-04-08 02:41:03,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721134928] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:41:03,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:41:03,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 02:41:03,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052772256] [2022-04-08 02:41:03,144 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:41:03,145 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-08 02:41:03,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:41:03,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 02:41:03,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:41:03,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 02:41:03,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:41:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 02:41:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 02:41:03,180 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 02:41:03,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:41:03,872 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 02:41:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 02:41:03,872 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-08 02:41:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:41:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 02:41:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 02:41:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 02:41:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 02:41:03,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-08 02:41:03,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:41:03,932 INFO L225 Difference]: With dead ends: 60 [2022-04-08 02:41:03,932 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 02:41:03,932 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 02:41:03,932 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 02:41:03,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 02:41:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 02:41:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 02:41:03,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:41:03,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 02:41:03,964 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 02:41:03,964 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 02:41:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:41:03,965 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 02:41:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 02:41:03,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:41:03,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:41:03,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-08 02:41:03,966 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-08 02:41:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:41:03,967 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 02:41:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 02:41:03,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:41:03,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:41:03,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:41:03,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:41:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 02:41:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-08 02:41:03,969 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-08 02:41:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:41:03,969 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-08 02:41:03,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 02:41:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 02:41:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 02:41:03,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:41:03,970 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:41:04,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 02:41:04,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 02:41:04,183 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:41:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:41:04,184 INFO L85 PathProgramCache]: Analyzing trace with hash 288751971, now seen corresponding path program 8 times [2022-04-08 02:41:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:41:04,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50625392] [2022-04-08 02:41:04,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:41:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:41:04,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:41:04,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240141637] [2022-04-08 02:41:04,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 02:41:04,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:41:04,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:41:04,208 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:41:04,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 02:41:04,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 02:41:04,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:41:04,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-08 02:41:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:41:04,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:41:05,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {4214#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {4214#true} [68] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {4214#true} is VALID [2022-04-08 02:41:05,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {4214#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4214#true} {4214#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {4214#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {4214#true} [70] mainENTRY-->L21: Formula: (and (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_2, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~k~0, main_~c~0, main_~y~0] {4214#true} is VALID [2022-04-08 02:41:05,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {4214#true} [72] L21-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {4214#true} is VALID [2022-04-08 02:41:05,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {4214#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4214#true} is VALID [2022-04-08 02:41:05,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {4214#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {4214#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,505 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4214#true} {4214#true} [96] assume_abort_if_notEXIT-->L21-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~k~0_9) (<= v_main_~k~0_9 10)) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {4214#true} is VALID [2022-04-08 02:41:05,505 INFO L272 TraceCheckUtils]: 11: Hoare triple {4214#true} [73] L21-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {4214#true} is VALID [2022-04-08 02:41:05,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {4214#true} [74] assume_abort_if_notENTRY-->L7: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4214#true} is VALID [2022-04-08 02:41:05,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {4214#true} [77] L7-->L7-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {4214#true} [81] L7-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,505 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4214#true} {4214#true} [97] assume_abort_if_notEXIT-->L22: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= v_main_~k~0_10 256) 1 0)) InVars {main_~k~0=v_main_~k~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {4214#true} is VALID [2022-04-08 02:41:05,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {4214#true} [75] L22-->L28-2: Formula: (and (= v_main_~c~0_2 0) (= v_main_~y~0_4 0) (= v_main_~x~0_3 0)) InVars {} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {4267#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:41:05,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {4267#(and (= main_~c~0 0) (= main_~y~0 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4267#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:41:05,506 INFO L272 TraceCheckUtils]: 18: Hoare triple {4267#(and (= main_~c~0 0) (= main_~y~0 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4214#true} is VALID [2022-04-08 02:41:05,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {4214#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4214#true} is VALID [2022-04-08 02:41:05,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {4214#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {4214#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,507 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4214#true} {4267#(and (= main_~c~0 0) (= main_~y~0 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4267#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:41:05,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {4267#(and (= main_~c~0 0) (= main_~y~0 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:41:05,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:41:05,507 INFO L272 TraceCheckUtils]: 25: Hoare triple {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4214#true} is VALID [2022-04-08 02:41:05,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {4214#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4214#true} is VALID [2022-04-08 02:41:05,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {4214#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {4214#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,508 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4214#true} {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:41:05,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 02:41:05,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 02:41:05,509 INFO L272 TraceCheckUtils]: 32: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4214#true} is VALID [2022-04-08 02:41:05,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {4214#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4214#true} is VALID [2022-04-08 02:41:05,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {4214#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {4214#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,510 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4214#true} {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-08 02:41:05,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4333#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:41:05,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {4333#(and (= main_~y~0 3) (= main_~c~0 3))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4333#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:41:05,511 INFO L272 TraceCheckUtils]: 39: Hoare triple {4333#(and (= main_~y~0 3) (= main_~c~0 3))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4214#true} is VALID [2022-04-08 02:41:05,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {4214#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4214#true} is VALID [2022-04-08 02:41:05,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {4214#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {4214#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,511 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4214#true} {4333#(and (= main_~y~0 3) (= main_~c~0 3))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4333#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:41:05,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {4333#(and (= main_~y~0 3) (= main_~c~0 3))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:41:05,512 INFO L290 TraceCheckUtils]: 45: Hoare triple {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:41:05,512 INFO L272 TraceCheckUtils]: 46: Hoare triple {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4214#true} is VALID [2022-04-08 02:41:05,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {4214#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4214#true} is VALID [2022-04-08 02:41:05,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {4214#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {4214#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,513 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4214#true} {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:41:05,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 02:41:05,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 02:41:05,513 INFO L272 TraceCheckUtils]: 53: Hoare triple {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4214#true} is VALID [2022-04-08 02:41:05,513 INFO L290 TraceCheckUtils]: 54: Hoare triple {4214#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4214#true} is VALID [2022-04-08 02:41:05,514 INFO L290 TraceCheckUtils]: 55: Hoare triple {4214#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,514 INFO L290 TraceCheckUtils]: 56: Hoare triple {4214#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,514 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4214#true} {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 02:41:05,514 INFO L290 TraceCheckUtils]: 58: Hoare triple {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 02:41:05,515 INFO L290 TraceCheckUtils]: 59: Hoare triple {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 02:41:05,515 INFO L272 TraceCheckUtils]: 60: Hoare triple {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4214#true} is VALID [2022-04-08 02:41:05,515 INFO L290 TraceCheckUtils]: 61: Hoare triple {4214#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4214#true} is VALID [2022-04-08 02:41:05,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {4214#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,515 INFO L290 TraceCheckUtils]: 63: Hoare triple {4214#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,515 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4214#true} {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 02:41:05,516 INFO L290 TraceCheckUtils]: 65: Hoare triple {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:41:05,516 INFO L290 TraceCheckUtils]: 66: Hoare triple {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:41:05,516 INFO L272 TraceCheckUtils]: 67: Hoare triple {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4214#true} is VALID [2022-04-08 02:41:05,516 INFO L290 TraceCheckUtils]: 68: Hoare triple {4214#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:41:05,517 INFO L290 TraceCheckUtils]: 69: Hoare triple {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:41:05,517 INFO L290 TraceCheckUtils]: 70: Hoare triple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:41:05,518 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4442#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} is VALID [2022-04-08 02:41:05,519 INFO L290 TraceCheckUtils]: 72: Hoare triple {4442#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} [87] L29-1-->L28-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~x~0_5 (+ (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 (* v_main_~y~0_6 v_main_~y~0_6)))) v_main_~x~0_6)) (< v_main_~c~0_5 v_main_~k~0_8) (= v_main_~y~0_6 (+ v_main_~y~0_7 1))) InVars {main_~y~0=v_main_~y~0_7, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_8} OutVars{main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_4, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 02:41:05,519 INFO L290 TraceCheckUtils]: 73: Hoare triple {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} [80] L28-2-->L29: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 02:41:05,519 INFO L272 TraceCheckUtils]: 74: Hoare triple {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} [83] L29-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4214#true} is VALID [2022-04-08 02:41:05,519 INFO L290 TraceCheckUtils]: 75: Hoare triple {4214#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4214#true} is VALID [2022-04-08 02:41:05,519 INFO L290 TraceCheckUtils]: 76: Hoare triple {4214#true} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,519 INFO L290 TraceCheckUtils]: 77: Hoare triple {4214#true} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4214#true} is VALID [2022-04-08 02:41:05,520 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4214#true} {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} [99] __VERIFIER_assertEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 (* (- 2) v_main_~y~0_8)))))) (* (- 1) (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 5))) v_main_~y~0_8)) (* v_main_~x~0_7 12) (* (- 1) (* v_main_~y~0_8 (* (* v_main_~y~0_8 (* v_main_~y~0_8 (* v_main_~y~0_8 6))) v_main_~y~0_8))) (* v_main_~y~0_8 v_main_~y~0_8)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-08 02:41:05,520 INFO L290 TraceCheckUtils]: 79: Hoare triple {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} [86] L29-1-->L28-3: Formula: (not (< v_main_~c~0_3 v_main_~k~0_7)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_7} AuxVars[] AssignedVars[] {4468#(and (< 7 main_~k~0) (= main_~y~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (<= main_~k~0 8))} is VALID [2022-04-08 02:41:05,520 INFO L272 TraceCheckUtils]: 80: Hoare triple {4468#(and (< 7 main_~k~0) (= main_~y~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (<= main_~k~0 8))} [82] L28-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4214#true} is VALID [2022-04-08 02:41:05,521 INFO L290 TraceCheckUtils]: 81: Hoare triple {4214#true} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:41:05,521 INFO L290 TraceCheckUtils]: 82: Hoare triple {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [90] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:41:05,521 INFO L290 TraceCheckUtils]: 83: Hoare triple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} [94] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:41:05,522 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} {4468#(and (< 7 main_~k~0) (= main_~y~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (<= main_~k~0 8))} [100] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 6))) v_main_~y~0_9)) (- 1)) (* v_main_~y~0_9 v_main_~y~0_9) (* v_main_~x~0_8 12) (* (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* v_main_~y~0_9 (* (- 2) v_main_~y~0_9))))) v_main_~y~0_9) (* (- 1) (* v_main_~y~0_9 (* (* v_main_~y~0_9 (* v_main_~y~0_9 5)) v_main_~y~0_9)))) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4484#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 02:41:05,523 INFO L272 TraceCheckUtils]: 85: Hoare triple {4484#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [84] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~y~0_10 v_main_~y~0_10) (* v_main_~k~0_11 v_main_~y~0_10)) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {4488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:41:05,523 INFO L290 TraceCheckUtils]: 86: Hoare triple {4488#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:41:05,523 INFO L290 TraceCheckUtils]: 87: Hoare triple {4492#(<= 1 __VERIFIER_assert_~cond)} [89] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4215#false} is VALID [2022-04-08 02:41:05,523 INFO L290 TraceCheckUtils]: 88: Hoare triple {4215#false} [92] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4215#false} is VALID [2022-04-08 02:41:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 63 proven. 113 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 02:41:05,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:41:31,824 WARN L833 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* (- 2) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 5) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) 12) 0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0)))))) is different from false [2022-04-08 02:41:31,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:41:31,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50625392] [2022-04-08 02:41:31,827 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:41:31,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240141637] [2022-04-08 02:41:31,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240141637] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:41:31,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:41:31,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-08 02:41:31,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783972698] [2022-04-08 02:41:31,827 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:41:31,828 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-08 02:41:31,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:41:31,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 02:41:31,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:41:31,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 02:41:31,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:41:31,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 02:41:31,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=435, Unknown=2, NotChecked=42, Total=552 [2022-04-08 02:41:31,871 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 02:41:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:41:33,096 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-08 02:41:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 02:41:33,097 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-08 02:41:33,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:41:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 02:41:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-04-08 02:41:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 02:41:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-04-08 02:41:33,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2022-04-08 02:41:33,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:41:33,156 INFO L225 Difference]: With dead ends: 63 [2022-04-08 02:41:33,156 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 02:41:33,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=94, Invalid=558, Unknown=2, NotChecked=48, Total=702 [2022-04-08 02:41:33,157 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 02:41:33,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 383 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 02:41:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 02:41:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 02:41:33,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:41:33,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 02:41:33,178 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 02:41:33,178 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 02:41:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:41:33,180 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 02:41:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 02:41:33,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:41:33,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:41:33,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-08 02:41:33,180 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-08 02:41:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:41:33,181 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 02:41:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 02:41:33,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:41:33,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:41:33,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:41:33,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:41:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 02:41:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-08 02:41:33,183 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-08 02:41:33,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:41:33,183 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-08 02:41:33,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 02:41:33,183 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 02:41:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-08 02:41:33,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:41:33,184 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:41:33,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 02:41:33,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 02:41:33,389 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:41:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:41:33,389 INFO L85 PathProgramCache]: Analyzing trace with hash -482784521, now seen corresponding path program 9 times [2022-04-08 02:41:33,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:41:33,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303049725] [2022-04-08 02:41:33,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:41:33,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:41:33,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:41:33,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537235824] [2022-04-08 02:41:33,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-08 02:41:33,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:41:33,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:41:33,408 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:41:33,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process