/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/ps4-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 01:28:52,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 01:28:52,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 01:28:52,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 01:28:52,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 01:28:52,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 01:28:52,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 01:28:52,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 01:28:52,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 01:28:52,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 01:28:52,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 01:28:52,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 01:28:52,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 01:28:52,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 01:28:52,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 01:28:52,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 01:28:52,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 01:28:52,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 01:28:52,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 01:28:52,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 01:28:52,725 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 01:28:52,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 01:28:52,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 01:28:52,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 01:28:52,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 01:28:52,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 01:28:52,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 01:28:52,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 01:28:52,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 01:28:52,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 01:28:52,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 01:28:52,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 01:28:52,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 01:28:52,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 01:28:52,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 01:28:52,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 01:28:52,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 01:28:52,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 01:28:52,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 01:28:52,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 01:28:52,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 01:28:52,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 01:28:52,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 01:28:52,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 01:28:52,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 01:28:52,774 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 01:28:52,775 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 01:28:52,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 01:28:52,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 01:28:52,776 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 01:28:52,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 01:28:52,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 01:28:52,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 01:28:52,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 01:28:52,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 01:28:52,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 01:28:52,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 01:28:52,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 01:28:52,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 01:28:52,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 01:28:52,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 01:28:52,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 01:28:52,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 01:28:52,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 01:28:52,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 01:28:52,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 01:28:52,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 01:28:52,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 01:28:52,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 01:28:52,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 01:28:52,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 01:28:52,779 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 01:28:52,780 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-28 01:28:52,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 01:28:52,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 01:28:52,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 01:28:52,970 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 01:28:52,971 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 01:28:52,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c [2022-04-28 01:28:53,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966f3f269/66be1b5628ff450490af6c04fbd7a7e7/FLAGe2721e63a [2022-04-28 01:28:53,395 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 01:28:53,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c [2022-04-28 01:28:53,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966f3f269/66be1b5628ff450490af6c04fbd7a7e7/FLAGe2721e63a [2022-04-28 01:28:53,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966f3f269/66be1b5628ff450490af6c04fbd7a7e7 [2022-04-28 01:28:53,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 01:28:53,424 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 01:28:53,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 01:28:53,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 01:28:53,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 01:28:53,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:28:53" (1/1) ... [2022-04-28 01:28:53,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c18ccaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:28:53, skipping insertion in model container [2022-04-28 01:28:53,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:28:53" (1/1) ... [2022-04-28 01:28:53,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 01:28:53,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 01:28:53,583 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/ps4-ll_unwindbound20.c[458,471] [2022-04-28 01:28:53,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 01:28:53,614 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 01:28:53,624 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/ps4-ll_unwindbound20.c[458,471] [2022-04-28 01:28:53,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 01:28:53,639 INFO L208 MainTranslator]: Completed translation [2022-04-28 01:28:53,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:28:53 WrapperNode [2022-04-28 01:28:53,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 01:28:53,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 01:28:53,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 01:28:53,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 01:28:53,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:28:53" (1/1) ... [2022-04-28 01:28:53,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:28:53" (1/1) ... [2022-04-28 01:28:53,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:28:53" (1/1) ... [2022-04-28 01:28:53,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:28:53" (1/1) ... [2022-04-28 01:28:53,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:28:53" (1/1) ... [2022-04-28 01:28:53,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:28:53" (1/1) ... [2022-04-28 01:28:53,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:28:53" (1/1) ... [2022-04-28 01:28:53,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 01:28:53,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 01:28:53,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 01:28:53,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 01:28:53,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:28:53" (1/1) ... [2022-04-28 01:28:53,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 01:28:53,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:28:53,686 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-28 01:28:53,699 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-28 01:28:53,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 01:28:53,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 01:28:53,720 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 01:28:53,720 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 01:28:53,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 01:28:53,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 01:28:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 01:28:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 01:28:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 01:28:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 01:28:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 01:28:53,720 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 01:28:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 01:28:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 01:28:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 01:28:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 01:28:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 01:28:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 01:28:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 01:28:53,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 01:28:53,765 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 01:28:53,766 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 01:28:53,864 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 01:28:53,870 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 01:28:53,870 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 01:28:53,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:28:53 BoogieIcfgContainer [2022-04-28 01:28:53,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 01:28:53,873 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 01:28:53,873 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 01:28:53,874 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 01:28:53,876 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:28:53" (1/1) ... [2022-04-28 01:28:53,878 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 01:28:53,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 01:28:53 BasicIcfg [2022-04-28 01:28:53,898 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 01:28:53,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 01:28:53,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 01:28:53,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 01:28:53,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:28:53" (1/4) ... [2022-04-28 01:28:53,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319693d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:28:53, skipping insertion in model container [2022-04-28 01:28:53,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:28:53" (2/4) ... [2022-04-28 01:28:53,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319693d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:28:53, skipping insertion in model container [2022-04-28 01:28:53,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:28:53" (3/4) ... [2022-04-28 01:28:53,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319693d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:28:53, skipping insertion in model container [2022-04-28 01:28:53,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 01:28:53" (4/4) ... [2022-04-28 01:28:53,905 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound20.cqvasr [2022-04-28 01:28:53,916 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 01:28:53,916 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 01:28:53,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 01:28:53,988 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f177fb7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53063081 [2022-04-28 01:28:53,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 01:28:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:28:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 01:28:54,022 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:28:54,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:28:54,023 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:28:54,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:28:54,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1984627219, now seen corresponding path program 1 times [2022-04-28 01:28:54,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:28:54,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083677185] [2022-04-28 01:28:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:28:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:28:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 01:28:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:54,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {26#true} is VALID [2022-04-28 01:28:54,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-28 01:28:54,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-28 01:28:54,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 01:28:54,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {26#true} is VALID [2022-04-28 01:28:54,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-28 01:28:54,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-28 01:28:54,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-28 01:28:54,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {26#true} is VALID [2022-04-28 01:28:54,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [66] L27-3-->L27-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-28 01:28:54,260 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {27#false} is VALID [2022-04-28 01:28:54,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {27#false} is VALID [2022-04-28 01:28:54,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-28 01:28:54,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-28 01:28:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 01:28:54,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:28:54,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083677185] [2022-04-28 01:28:54,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083677185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:28:54,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:28:54,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 01:28:54,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707863745] [2022-04-28 01:28:54,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:28:54,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 01:28:54,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:28:54,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:54,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:28:54,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 01:28:54,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:28:54,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 01:28:54,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 01:28:54,328 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:54,463 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-28 01:28:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 01:28:54,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 01:28:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:28:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 01:28:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-28 01:28:54,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-28 01:28:54,549 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-28 01:28:54,563 INFO L225 Difference]: With dead ends: 41 [2022-04-28 01:28:54,563 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 01:28:54,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 01:28:54,571 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:28:54,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:28:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 01:28:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-28 01:28:54,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:28:54,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:28:54,599 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:28:54,600 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:28:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:54,602 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 01:28:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 01:28:54,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:28:54,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:28:54,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-28 01:28:54,604 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-28 01:28:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:54,608 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 01:28:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 01:28:54,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:28:54,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:28:54,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:28:54,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:28:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:28:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-28 01:28:54,612 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-28 01:28:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:28:54,612 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-28 01:28:54,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 01:28:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 01:28:54,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:28:54,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:28:54,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 01:28:54,614 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:28:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:28:54,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1423332195, now seen corresponding path program 1 times [2022-04-28 01:28:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:28:54,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546968339] [2022-04-28 01:28:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:28:54,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:28:54,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:28:54,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817111652] [2022-04-28 01:28:54,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:28:54,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:28:54,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:28:54,636 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-28 01:28:54,637 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-28 01:28:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:54,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 01:28:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:54,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:28:54,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {155#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {155#true} is VALID [2022-04-28 01:28:54,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {163#(<= ~counter~0 0)} is VALID [2022-04-28 01:28:54,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#(<= ~counter~0 0)} is VALID [2022-04-28 01:28:54,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#(<= ~counter~0 0)} {155#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#(<= ~counter~0 0)} is VALID [2022-04-28 01:28:54,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#(<= ~counter~0 0)} is VALID [2022-04-28 01:28:54,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {163#(<= ~counter~0 0)} is VALID [2022-04-28 01:28:54,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {179#(<= |main_#t~post5| 0)} is VALID [2022-04-28 01:28:54,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(<= |main_#t~post5| 0)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 20)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {156#false} is VALID [2022-04-28 01:28:54,849 INFO L272 TraceCheckUtils]: 8: Hoare triple {156#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {156#false} is VALID [2022-04-28 01:28:54,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {156#false} is VALID [2022-04-28 01:28:54,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {156#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {156#false} is VALID [2022-04-28 01:28:54,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {156#false} is VALID [2022-04-28 01:28:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 01:28:54,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 01:28:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:28:54,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546968339] [2022-04-28 01:28:54,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:28:54,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817111652] [2022-04-28 01:28:54,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817111652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:28:54,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:28:54,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 01:28:54,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838113794] [2022-04-28 01:28:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:28:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 01:28:54,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:28:54,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:54,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:28:54,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 01:28:54,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:28:54,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 01:28:54,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 01:28:54,873 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:54,924 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 01:28:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 01:28:54,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 01:28:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:28:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-28 01:28:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-28 01:28:54,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-28 01:28:54,977 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-28 01:28:54,979 INFO L225 Difference]: With dead ends: 28 [2022-04-28 01:28:54,979 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 01:28:54,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 01:28:54,980 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:28:54,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:28:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 01:28:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 01:28:54,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:28:54,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:28:54,986 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:28:54,987 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:28:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:54,988 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 01:28:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 01:28:54,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:28:54,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:28:54,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-28 01:28:54,990 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-28 01:28:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:54,991 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 01:28:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 01:28:54,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:28:54,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:28:54,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:28:54,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:28:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:28:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 01:28:54,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-28 01:28:54,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:28:54,994 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 01:28:54,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 01:28:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 01:28:54,995 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:28:54,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:28:55,021 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-28 01:28:55,213 WARN L477 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-28 01:28:55,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:28:55,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:28:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1424404671, now seen corresponding path program 1 times [2022-04-28 01:28:55,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:28:55,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720632516] [2022-04-28 01:28:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:28:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:28:55,227 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:28:55,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184179292] [2022-04-28 01:28:55,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:28:55,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:28:55,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:28:55,228 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-28 01:28:55,232 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-28 01:28:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:55,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 01:28:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:55,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:28:55,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {305#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-28 01:28:55,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {305#true} is VALID [2022-04-28 01:28:55,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-28 01:28:55,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-28 01:28:55,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-28 01:28:55,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:28:55,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:28:55,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {325#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:28:55,413 INFO L272 TraceCheckUtils]: 8: Hoare triple {325#(and (= main_~x~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:28:55,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:28:55,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-28 01:28:55,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {306#false} is VALID [2022-04-28 01:28:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 01:28:55,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 01:28:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:28:55,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720632516] [2022-04-28 01:28:55,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:28:55,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184179292] [2022-04-28 01:28:55,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184179292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:28:55,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:28:55,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 01:28:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555315714] [2022-04-28 01:28:55,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:28:55,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 01:28:55,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:28:55,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:55,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:28:55,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 01:28:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:28:55,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 01:28:55,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 01:28:55,430 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:55,570 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 01:28:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 01:28:55,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 01:28:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:28:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 01:28:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 01:28:55,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-28 01:28:55,612 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-28 01:28:55,614 INFO L225 Difference]: With dead ends: 30 [2022-04-28 01:28:55,614 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 01:28:55,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-28 01:28:55,615 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 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-28 01:28:55,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:28:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 01:28:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 01:28:55,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:28:55,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:28:55,622 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:28:55,623 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:28:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:55,624 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 01:28:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 01:28:55,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:28:55,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:28:55,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 01:28:55,626 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 01:28:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:55,627 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 01:28:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 01:28:55,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:28:55,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:28:55,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:28:55,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:28:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:28:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 01:28:55,629 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-28 01:28:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:28:55,629 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 01:28:55,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 01:28:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 01:28:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 01:28:55,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:28:55,630 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:28:55,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 01:28:55,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 01:28:55,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:28:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:28:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash -381498108, now seen corresponding path program 1 times [2022-04-28 01:28:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:28:55,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412398007] [2022-04-28 01:28:55,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:28:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:28:55,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:28:55,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1621403835] [2022-04-28 01:28:55,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:28:55,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:28:55,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:28:55,860 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-28 01:28:55,862 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-28 01:28:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:55,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 01:28:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:55,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:28:56,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-28 01:28:56,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {489#(<= ~counter~0 0)} is VALID [2022-04-28 01:28:56,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#(<= ~counter~0 0)} is VALID [2022-04-28 01:28:56,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {489#(<= ~counter~0 0)} {481#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#(<= ~counter~0 0)} is VALID [2022-04-28 01:28:56,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {489#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {489#(<= ~counter~0 0)} is VALID [2022-04-28 01:28:56,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {489#(<= ~counter~0 0)} is VALID [2022-04-28 01:28:56,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {489#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {505#(<= ~counter~0 1)} is VALID [2022-04-28 01:28:56,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {505#(<= ~counter~0 1)} is VALID [2022-04-28 01:28:56,073 INFO L272 TraceCheckUtils]: 8: Hoare triple {505#(<= ~counter~0 1)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {505#(<= ~counter~0 1)} is VALID [2022-04-28 01:28:56,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(<= ~counter~0 1)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {505#(<= ~counter~0 1)} is VALID [2022-04-28 01:28:56,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= ~counter~0 1)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {505#(<= ~counter~0 1)} is VALID [2022-04-28 01:28:56,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(<= ~counter~0 1)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#(<= ~counter~0 1)} is VALID [2022-04-28 01:28:56,075 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {505#(<= ~counter~0 1)} {505#(<= ~counter~0 1)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {505#(<= ~counter~0 1)} is VALID [2022-04-28 01:28:56,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {505#(<= ~counter~0 1)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {505#(<= ~counter~0 1)} is VALID [2022-04-28 01:28:56,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#(<= ~counter~0 1)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {530#(<= |main_#t~post5| 1)} is VALID [2022-04-28 01:28:56,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(<= |main_#t~post5| 1)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 20)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {482#false} is VALID [2022-04-28 01:28:56,076 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {482#false} is VALID [2022-04-28 01:28:56,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {482#false} is VALID [2022-04-28 01:28:56,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-28 01:28:56,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-28 01:28:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 01:28:56,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:28:56,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {482#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-28 01:28:56,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {482#false} is VALID [2022-04-28 01:28:56,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {482#false} is VALID [2022-04-28 01:28:56,224 INFO L272 TraceCheckUtils]: 16: Hoare triple {482#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {482#false} is VALID [2022-04-28 01:28:56,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {558#(< |main_#t~post5| 20)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 20)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {482#false} is VALID [2022-04-28 01:28:56,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(< ~counter~0 20)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {558#(< |main_#t~post5| 20)} is VALID [2022-04-28 01:28:56,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(< ~counter~0 20)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {562#(< ~counter~0 20)} is VALID [2022-04-28 01:28:56,226 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {481#true} {562#(< ~counter~0 20)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {562#(< ~counter~0 20)} is VALID [2022-04-28 01:28:56,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {481#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-28 01:28:56,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {481#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-28 01:28:56,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {481#true} is VALID [2022-04-28 01:28:56,227 INFO L272 TraceCheckUtils]: 8: Hoare triple {562#(< ~counter~0 20)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {481#true} is VALID [2022-04-28 01:28:56,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {562#(< ~counter~0 20)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {562#(< ~counter~0 20)} is VALID [2022-04-28 01:28:56,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {587#(< ~counter~0 19)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {562#(< ~counter~0 20)} is VALID [2022-04-28 01:28:56,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#(< ~counter~0 19)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {587#(< ~counter~0 19)} is VALID [2022-04-28 01:28:56,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#(< ~counter~0 19)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#(< ~counter~0 19)} is VALID [2022-04-28 01:28:56,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#(< ~counter~0 19)} {481#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#(< ~counter~0 19)} is VALID [2022-04-28 01:28:56,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#(< ~counter~0 19)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#(< ~counter~0 19)} is VALID [2022-04-28 01:28:56,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {587#(< ~counter~0 19)} is VALID [2022-04-28 01:28:56,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#true} is VALID [2022-04-28 01:28:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 01:28:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:28:56,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412398007] [2022-04-28 01:28:56,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:28:56,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621403835] [2022-04-28 01:28:56,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621403835] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 01:28:56,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 01:28:56,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 01:28:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851265917] [2022-04-28 01:28:56,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 01:28:56,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-28 01:28:56,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:28:56,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 01:28:56,261 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-28 01:28:56,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 01:28:56,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:28:56,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 01:28:56,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 01:28:56,262 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 01:28:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:56,477 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-28 01:28:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 01:28:56,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-28 01:28:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:28:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 01:28:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-28 01:28:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 01:28:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-28 01:28:56,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2022-04-28 01:28:56,549 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-28 01:28:56,551 INFO L225 Difference]: With dead ends: 60 [2022-04-28 01:28:56,551 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 01:28:56,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-28 01:28:56,552 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:28:56,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:28:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 01:28:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-28 01:28:56,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:28:56,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:28:56,567 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:28:56,568 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:28:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:56,571 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 01:28:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 01:28:56,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:28:56,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:28:56,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-28 01:28:56,573 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-28 01:28:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:56,577 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 01:28:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 01:28:56,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:28:56,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:28:56,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:28:56,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:28:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:28:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 01:28:56,580 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 20 [2022-04-28 01:28:56,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:28:56,580 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 01:28:56,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 01:28:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 01:28:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 01:28:56,581 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:28:56,581 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:28:56,603 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-28 01:28:56,799 WARN L477 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-28 01:28:56,799 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:28:56,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:28:56,800 INFO L85 PathProgramCache]: Analyzing trace with hash -380425632, now seen corresponding path program 1 times [2022-04-28 01:28:56,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:28:56,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684360821] [2022-04-28 01:28:56,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:28:56,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:28:56,817 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:28:56,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [970534998] [2022-04-28 01:28:56,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:28:56,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:28:56,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:28:56,820 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-28 01:28:56,823 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-28 01:28:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:56,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 01:28:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:56,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:28:56,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {875#true} is VALID [2022-04-28 01:28:57,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:28:57,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:28:57,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:28:57,004 INFO L272 TraceCheckUtils]: 8: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {875#true} is VALID [2022-04-28 01:28:57,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {875#true} is VALID [2022-04-28 01:28:57,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,005 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {895#(and (= main_~x~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {895#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:28:57,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {895#(and (= main_~x~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 01:28:57,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 01:28:57,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 01:28:57,008 INFO L272 TraceCheckUtils]: 16: Hoare triple {920#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:28:57,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:28:57,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {876#false} is VALID [2022-04-28 01:28:57,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {876#false} is VALID [2022-04-28 01:28:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 01:28:57,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:28:57,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {876#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {876#false} is VALID [2022-04-28 01:28:57,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {876#false} is VALID [2022-04-28 01:28:57,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:28:57,273 INFO L272 TraceCheckUtils]: 16: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:28:57,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 01:28:57,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 01:28:57,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 01:28:57,291 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {875#true} {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 01:28:57,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {875#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {875#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {875#true} is VALID [2022-04-28 01:28:57,292 INFO L272 TraceCheckUtils]: 8: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {875#true} is VALID [2022-04-28 01:28:57,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 01:28:57,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 01:28:57,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {950#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-28 01:28:57,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {875#true} is VALID [2022-04-28 01:28:57,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {875#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-28 01:28:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 01:28:57,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:28:57,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684360821] [2022-04-28 01:28:57,297 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:28:57,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970534998] [2022-04-28 01:28:57,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970534998] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 01:28:57,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:28:57,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 01:28:57,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687453673] [2022-04-28 01:28:57,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:28:57,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 01:28:57,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:28:57,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 01:28:57,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:28:57,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 01:28:57,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:28:57,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 01:28:57,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 01:28:57,357 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 01:28:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:57,485 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-28 01:28:57,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 01:28:57,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 01:28:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:28:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 01:28:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-28 01:28:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 01:28:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-28 01:28:57,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-28 01:28:57,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:28:57,522 INFO L225 Difference]: With dead ends: 62 [2022-04-28 01:28:57,522 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 01:28:57,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 01:28:57,523 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:28:57,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:28:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 01:28:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-28 01:28:57,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:28:57,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:28:57,539 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:28:57,539 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:28:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:57,541 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-28 01:28:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-28 01:28:57,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:28:57,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:28:57,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-28 01:28:57,542 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-28 01:28:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:28:57,544 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-28 01:28:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-28 01:28:57,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:28:57,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:28:57,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:28:57,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:28:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:28:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-28 01:28:57,546 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2022-04-28 01:28:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:28:57,546 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-28 01:28:57,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 01:28:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-28 01:28:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 01:28:57,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:28:57,547 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:28:57,572 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-28 01:28:57,769 WARN L477 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-28 01:28:57,769 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:28:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:28:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1647871298, now seen corresponding path program 1 times [2022-04-28 01:28:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:28:57,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743764172] [2022-04-28 01:28:57,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:28:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:28:57,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:28:57,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1701708061] [2022-04-28 01:28:57,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:28:57,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:28:57,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:28:57,783 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-28 01:28:57,799 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-28 01:28:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:57,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 01:28:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:28:57,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:28:58,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {1257#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 01:28:58,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {1257#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {1257#true} is VALID [2022-04-28 01:28:58,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {1257#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 01:28:58,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1257#true} {1257#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 01:28:58,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 01:28:58,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {1257#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:28:58,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:28:58,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:28:58,212 INFO L272 TraceCheckUtils]: 8: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1257#true} is VALID [2022-04-28 01:28:58,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1257#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1257#true} is VALID [2022-04-28 01:28:58,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {1257#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 01:28:58,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {1257#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-28 01:28:58,213 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1257#true} {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:28:58,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(and (<= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 01:28:58,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 01:28:58,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 01:28:58,216 INFO L272 TraceCheckUtils]: 16: Hoare triple {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1257#true} is VALID [2022-04-28 01:28:58,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:28:58,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {1315#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:28:58,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:28:58,218 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1319#(not (= |__VERIFIER_assert_#in~cond| 0))} {1302#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (* main_~y~0 main_~y~0 main_~y~0)) (< 0 main_~k~0) (<= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 01:28:58,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {1326#(and (= main_~y~0 1) (< 0 main_~k~0) (<= main_~c~0 1))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {1330#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 01:28:58,219 INFO L272 TraceCheckUtils]: 22: Hoare triple {1330#(and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:28:58,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {1334#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1338#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:28:58,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {1338#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-28 01:28:58,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1258#false} is VALID [2022-04-28 01:28:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 01:28:58,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:29:16,803 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* (- 13) c_main_~y~0 c_main_~y~0)) (.cse3 (* (- 1) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (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))))) (not (= (mod (+ .cse1 .cse2 .cse3) 4) 0)) (not (<= (div (+ .cse1 .cse2 .cse3 (- 4)) (- 4)) (+ (* c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1 (* 3 (* c_main_~y~0 c_main_~y~0))))))) is different from false [2022-04-28 01:29:18,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:29:18,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743764172] [2022-04-28 01:29:18,929 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:29:18,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701708061] [2022-04-28 01:29:18,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701708061] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:29:18,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:29:18,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 01:29:18,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289250852] [2022-04-28 01:29:18,930 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:29:18,930 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 01:29:18,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:29:18,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:29:18,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:18,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 01:29:18,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:29:18,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 01:29:18,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=140, Unknown=1, NotChecked=24, Total=210 [2022-04-28 01:29:18,957 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:29:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:19,302 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-28 01:29:19,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 01:29:19,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 01:29:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:29:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:29:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-28 01:29:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:29:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-28 01:29:19,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-28 01:29:19,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:19,335 INFO L225 Difference]: With dead ends: 50 [2022-04-28 01:29:19,335 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 01:29:19,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=66, Invalid=209, Unknown=1, NotChecked=30, Total=306 [2022-04-28 01:29:19,336 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:29:19,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 01:29:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 01:29:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 01:29:19,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:29:19,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:19,357 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:19,357 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:19,359 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-28 01:29:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-28 01:29:19,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:19,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:19,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-28 01:29:19,360 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-28 01:29:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:19,362 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-28 01:29:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-28 01:29:19,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:19,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:19,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:29:19,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:29:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-28 01:29:19,364 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2022-04-28 01:29:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:29:19,364 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-28 01:29:19,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 01:29:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-28 01:29:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 01:29:19,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:29:19,365 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:29:19,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 01:29:19,587 WARN L477 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-28 01:29:19,588 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:29:19,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:29:19,588 INFO L85 PathProgramCache]: Analyzing trace with hash 31133987, now seen corresponding path program 2 times [2022-04-28 01:29:19,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:29:19,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599615478] [2022-04-28 01:29:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:29:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:29:19,602 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:29:19,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1155034839] [2022-04-28 01:29:19,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 01:29:19,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:29:19,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:29:19,609 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-28 01:29:19,611 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-28 01:29:19,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 01:29:19,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:29:19,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 01:29:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:29:19,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:29:20,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-28 01:29:20,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {1622#true} is VALID [2022-04-28 01:29:20,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1622#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-28 01:29:20,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1622#true} {1622#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-28 01:29:20,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {1622#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-28 01:29:20,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {1622#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:20,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:20,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:20,043 INFO L272 TraceCheckUtils]: 8: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1622#true} is VALID [2022-04-28 01:29:20,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1622#true} is VALID [2022-04-28 01:29:20,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {1622#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-28 01:29:20,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {1622#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-28 01:29:20,044 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1622#true} {1642#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1642#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:20,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {1642#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:29:20,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:29:20,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:29:20,045 INFO L272 TraceCheckUtils]: 16: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1622#true} is VALID [2022-04-28 01:29:20,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {1622#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1622#true} is VALID [2022-04-28 01:29:20,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {1622#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-28 01:29:20,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-28 01:29:20,047 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1622#true} {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:29:20,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {1667#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 01:29:20,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 01:29:20,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 01:29:20,049 INFO L272 TraceCheckUtils]: 24: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1622#true} is VALID [2022-04-28 01:29:20,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {1622#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1622#true} is VALID [2022-04-28 01:29:20,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {1622#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-28 01:29:20,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {1622#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-28 01:29:20,050 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1622#true} {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 01:29:20,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {1692#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-28 01:29:20,052 INFO L272 TraceCheckUtils]: 30: Hoare triple {1717#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:29:20,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {1721#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1725#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:29:20,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {1725#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1623#false} is VALID [2022-04-28 01:29:20,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {1623#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1623#false} is VALID [2022-04-28 01:29:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 01:29:20,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:29:20,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:29:20,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599615478] [2022-04-28 01:29:20,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:29:20,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155034839] [2022-04-28 01:29:20,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155034839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:29:20,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:29:20,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 01:29:20,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907364203] [2022-04-28 01:29:20,373 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:29:20,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-28 01:29:20,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:29:20,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:29:20,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:20,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 01:29:20,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:29:20,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 01:29:20,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 01:29:20,396 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:29:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:20,637 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-28 01:29:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 01:29:20,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-28 01:29:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:29:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:29:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 01:29:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:29:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 01:29:20,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-28 01:29:20,676 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-28 01:29:20,678 INFO L225 Difference]: With dead ends: 50 [2022-04-28 01:29:20,678 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 01:29:20,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 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-28 01:29:20,681 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:29:20,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 01:29:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 01:29:20,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 01:29:20,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:29:20,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:20,715 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:20,715 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:20,717 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-28 01:29:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-28 01:29:20,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:20,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:20,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-28 01:29:20,718 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-28 01:29:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:20,721 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-28 01:29:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-28 01:29:20,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:20,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:20,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:29:20,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:29:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-28 01:29:20,724 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2022-04-28 01:29:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:29:20,724 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-28 01:29:20,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:29:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-28 01:29:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 01:29:20,727 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:29:20,727 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:29:20,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 01:29:20,945 WARN L477 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-28 01:29:20,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:29:20,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:29:20,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1474833412, now seen corresponding path program 3 times [2022-04-28 01:29:20,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:29:20,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042591225] [2022-04-28 01:29:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:29:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:29:20,960 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:29:20,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401928757] [2022-04-28 01:29:20,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-28 01:29:20,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:29:20,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:29:20,970 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-28 01:29:20,984 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-28 01:29:21,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-28 01:29:21,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:29:21,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 01:29:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:29:21,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:29:21,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {2005#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {2005#true} is VALID [2022-04-28 01:29:21,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2005#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {2005#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {2005#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:21,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:21,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:21,468 INFO L272 TraceCheckUtils]: 8: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2005#true} is VALID [2022-04-28 01:29:21,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {2005#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2005#true} is VALID [2022-04-28 01:29:21,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,468 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2005#true} {2025#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2025#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:21,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {2025#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:21,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:21,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:21,470 INFO L272 TraceCheckUtils]: 16: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2005#true} is VALID [2022-04-28 01:29:21,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {2005#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2005#true} is VALID [2022-04-28 01:29:21,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,472 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2005#true} {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:21,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {2050#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:21,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:21,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:21,476 INFO L272 TraceCheckUtils]: 24: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2005#true} is VALID [2022-04-28 01:29:21,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {2005#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2005#true} is VALID [2022-04-28 01:29:21,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {2005#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {2005#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,477 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2005#true} {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:21,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 01:29:21,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 01:29:21,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 01:29:21,479 INFO L272 TraceCheckUtils]: 32: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2005#true} is VALID [2022-04-28 01:29:21,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {2005#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2005#true} is VALID [2022-04-28 01:29:21,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {2005#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {2005#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-28 01:29:21,479 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2005#true} {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 01:29:21,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {2100#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 01:29:21,481 INFO L272 TraceCheckUtils]: 38: Hoare triple {2125#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:29:21,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {2129#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:29:21,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {2133#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2006#false} is VALID [2022-04-28 01:29:21,481 INFO L290 TraceCheckUtils]: 41: Hoare triple {2006#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2006#false} is VALID [2022-04-28 01:29:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 01:29:21,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:29:21,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:29:21,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042591225] [2022-04-28 01:29:21,779 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:29:21,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401928757] [2022-04-28 01:29:21,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401928757] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:29:21,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:29:21,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 01:29:21,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736666353] [2022-04-28 01:29:21,780 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:29:21,780 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-28 01:29:21,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:29:21,781 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:21,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:21,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 01:29:21,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:29:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 01:29:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 01:29:21,812 INFO L87 Difference]: Start difference. First operand 45 states and 46 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:22,116 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 01:29:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 01:29:22,117 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-28 01:29:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:29:22,117 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 01:29:22,119 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 01:29:22,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 01:29:22,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:22,160 INFO L225 Difference]: With dead ends: 52 [2022-04-28 01:29:22,160 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 01:29:22,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 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-28 01:29:22,160 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:29:22,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 01:29:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 01:29:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 01:29:22,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:29:22,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:29:22,184 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:29:22,184 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:29:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:22,186 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-28 01:29:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 01:29:22,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:22,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:22,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 01:29:22,187 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 01:29:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:22,188 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-28 01:29:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 01:29:22,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:22,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:22,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:29:22,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:29:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:29:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-28 01:29:22,191 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-28 01:29:22,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:29:22,191 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-28 01:29:22,191 INFO L496 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:29:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 01:29:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 01:29:22,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:29:22,192 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:29:22,214 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-28 01:29:22,411 WARN L477 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-28 01:29:22,411 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:29:22,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:29:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 831591399, now seen corresponding path program 2 times [2022-04-28 01:29:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:29:22,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418389498] [2022-04-28 01:29:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:29:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:29:22,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:29:22,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955643018] [2022-04-28 01:29:22,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 01:29:22,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:29:22,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:29:22,425 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-28 01:29:22,431 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-28 01:29:22,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 01:29:22,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:29:22,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 01:29:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:29:22,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:29:22,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2423#true} is VALID [2022-04-28 01:29:22,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {2431#(<= ~counter~0 0)} is VALID [2022-04-28 01:29:22,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {2431#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2431#(<= ~counter~0 0)} is VALID [2022-04-28 01:29:22,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2431#(<= ~counter~0 0)} {2423#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2431#(<= ~counter~0 0)} is VALID [2022-04-28 01:29:22,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {2431#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2431#(<= ~counter~0 0)} is VALID [2022-04-28 01:29:22,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {2431#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {2431#(<= ~counter~0 0)} is VALID [2022-04-28 01:29:22,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {2431#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2447#(<= ~counter~0 1)} is VALID [2022-04-28 01:29:22,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2447#(<= ~counter~0 1)} is VALID [2022-04-28 01:29:22,736 INFO L272 TraceCheckUtils]: 8: Hoare triple {2447#(<= ~counter~0 1)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2447#(<= ~counter~0 1)} is VALID [2022-04-28 01:29:22,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {2447#(<= ~counter~0 1)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2447#(<= ~counter~0 1)} is VALID [2022-04-28 01:29:22,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {2447#(<= ~counter~0 1)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2447#(<= ~counter~0 1)} is VALID [2022-04-28 01:29:22,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#(<= ~counter~0 1)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2447#(<= ~counter~0 1)} is VALID [2022-04-28 01:29:22,738 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2447#(<= ~counter~0 1)} {2447#(<= ~counter~0 1)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2447#(<= ~counter~0 1)} is VALID [2022-04-28 01:29:22,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {2447#(<= ~counter~0 1)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2447#(<= ~counter~0 1)} is VALID [2022-04-28 01:29:22,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {2447#(<= ~counter~0 1)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2472#(<= ~counter~0 2)} is VALID [2022-04-28 01:29:22,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(<= ~counter~0 2)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2472#(<= ~counter~0 2)} is VALID [2022-04-28 01:29:22,740 INFO L272 TraceCheckUtils]: 16: Hoare triple {2472#(<= ~counter~0 2)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2472#(<= ~counter~0 2)} is VALID [2022-04-28 01:29:22,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {2472#(<= ~counter~0 2)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2472#(<= ~counter~0 2)} is VALID [2022-04-28 01:29:22,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#(<= ~counter~0 2)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2472#(<= ~counter~0 2)} is VALID [2022-04-28 01:29:22,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {2472#(<= ~counter~0 2)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2472#(<= ~counter~0 2)} is VALID [2022-04-28 01:29:22,748 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2472#(<= ~counter~0 2)} {2472#(<= ~counter~0 2)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2472#(<= ~counter~0 2)} is VALID [2022-04-28 01:29:22,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#(<= ~counter~0 2)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2472#(<= ~counter~0 2)} is VALID [2022-04-28 01:29:22,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {2472#(<= ~counter~0 2)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2497#(<= ~counter~0 3)} is VALID [2022-04-28 01:29:22,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {2497#(<= ~counter~0 3)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2497#(<= ~counter~0 3)} is VALID [2022-04-28 01:29:22,755 INFO L272 TraceCheckUtils]: 24: Hoare triple {2497#(<= ~counter~0 3)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2497#(<= ~counter~0 3)} is VALID [2022-04-28 01:29:22,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {2497#(<= ~counter~0 3)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2497#(<= ~counter~0 3)} is VALID [2022-04-28 01:29:22,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {2497#(<= ~counter~0 3)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2497#(<= ~counter~0 3)} is VALID [2022-04-28 01:29:22,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {2497#(<= ~counter~0 3)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2497#(<= ~counter~0 3)} is VALID [2022-04-28 01:29:22,758 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2497#(<= ~counter~0 3)} {2497#(<= ~counter~0 3)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2497#(<= ~counter~0 3)} is VALID [2022-04-28 01:29:22,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {2497#(<= ~counter~0 3)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2497#(<= ~counter~0 3)} is VALID [2022-04-28 01:29:22,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {2497#(<= ~counter~0 3)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2522#(<= ~counter~0 4)} is VALID [2022-04-28 01:29:22,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {2522#(<= ~counter~0 4)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2522#(<= ~counter~0 4)} is VALID [2022-04-28 01:29:22,762 INFO L272 TraceCheckUtils]: 32: Hoare triple {2522#(<= ~counter~0 4)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2522#(<= ~counter~0 4)} is VALID [2022-04-28 01:29:22,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {2522#(<= ~counter~0 4)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2522#(<= ~counter~0 4)} is VALID [2022-04-28 01:29:22,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {2522#(<= ~counter~0 4)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2522#(<= ~counter~0 4)} is VALID [2022-04-28 01:29:22,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {2522#(<= ~counter~0 4)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2522#(<= ~counter~0 4)} is VALID [2022-04-28 01:29:22,768 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2522#(<= ~counter~0 4)} {2522#(<= ~counter~0 4)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2522#(<= ~counter~0 4)} is VALID [2022-04-28 01:29:22,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {2522#(<= ~counter~0 4)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2522#(<= ~counter~0 4)} is VALID [2022-04-28 01:29:22,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {2522#(<= ~counter~0 4)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2547#(<= |main_#t~post5| 4)} is VALID [2022-04-28 01:29:22,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {2547#(<= |main_#t~post5| 4)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 20)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2424#false} is VALID [2022-04-28 01:29:22,769 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2424#false} is VALID [2022-04-28 01:29:22,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2424#false} is VALID [2022-04-28 01:29:22,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2424#false} is VALID [2022-04-28 01:29:22,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2424#false} is VALID [2022-04-28 01:29:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 01:29:22,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:29:23,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {2424#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2424#false} is VALID [2022-04-28 01:29:23,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {2424#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2424#false} is VALID [2022-04-28 01:29:23,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {2424#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2424#false} is VALID [2022-04-28 01:29:23,104 INFO L272 TraceCheckUtils]: 40: Hoare triple {2424#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {2424#false} is VALID [2022-04-28 01:29:23,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {2575#(< |main_#t~post5| 20)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 20)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2424#false} is VALID [2022-04-28 01:29:23,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {2579#(< ~counter~0 20)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2575#(< |main_#t~post5| 20)} is VALID [2022-04-28 01:29:23,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {2579#(< ~counter~0 20)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2579#(< ~counter~0 20)} is VALID [2022-04-28 01:29:23,112 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2423#true} {2579#(< ~counter~0 20)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2579#(< ~counter~0 20)} is VALID [2022-04-28 01:29:23,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {2423#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2423#true} is VALID [2022-04-28 01:29:23,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {2423#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2423#true} is VALID [2022-04-28 01:29:23,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {2423#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2423#true} is VALID [2022-04-28 01:29:23,113 INFO L272 TraceCheckUtils]: 32: Hoare triple {2579#(< ~counter~0 20)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2423#true} is VALID [2022-04-28 01:29:23,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {2579#(< ~counter~0 20)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2579#(< ~counter~0 20)} is VALID [2022-04-28 01:29:23,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {2604#(< ~counter~0 19)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2579#(< ~counter~0 20)} is VALID [2022-04-28 01:29:23,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {2604#(< ~counter~0 19)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2604#(< ~counter~0 19)} is VALID [2022-04-28 01:29:23,115 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2423#true} {2604#(< ~counter~0 19)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2604#(< ~counter~0 19)} is VALID [2022-04-28 01:29:23,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {2423#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2423#true} is VALID [2022-04-28 01:29:23,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {2423#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2423#true} is VALID [2022-04-28 01:29:23,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {2423#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2423#true} is VALID [2022-04-28 01:29:23,116 INFO L272 TraceCheckUtils]: 24: Hoare triple {2604#(< ~counter~0 19)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2423#true} is VALID [2022-04-28 01:29:23,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {2604#(< ~counter~0 19)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2604#(< ~counter~0 19)} is VALID [2022-04-28 01:29:23,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {2629#(< ~counter~0 18)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2604#(< ~counter~0 19)} is VALID [2022-04-28 01:29:23,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {2629#(< ~counter~0 18)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2629#(< ~counter~0 18)} is VALID [2022-04-28 01:29:23,117 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2423#true} {2629#(< ~counter~0 18)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2629#(< ~counter~0 18)} is VALID [2022-04-28 01:29:23,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {2423#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2423#true} is VALID [2022-04-28 01:29:23,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {2423#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2423#true} is VALID [2022-04-28 01:29:23,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {2423#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2423#true} is VALID [2022-04-28 01:29:23,118 INFO L272 TraceCheckUtils]: 16: Hoare triple {2629#(< ~counter~0 18)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2423#true} is VALID [2022-04-28 01:29:23,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {2629#(< ~counter~0 18)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2629#(< ~counter~0 18)} is VALID [2022-04-28 01:29:23,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {2654#(< ~counter~0 17)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2629#(< ~counter~0 18)} is VALID [2022-04-28 01:29:23,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {2654#(< ~counter~0 17)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {2654#(< ~counter~0 17)} is VALID [2022-04-28 01:29:23,119 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2423#true} {2654#(< ~counter~0 17)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2654#(< ~counter~0 17)} is VALID [2022-04-28 01:29:23,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {2423#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2423#true} is VALID [2022-04-28 01:29:23,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {2423#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2423#true} is VALID [2022-04-28 01:29:23,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {2423#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2423#true} is VALID [2022-04-28 01:29:23,120 INFO L272 TraceCheckUtils]: 8: Hoare triple {2654#(< ~counter~0 17)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {2423#true} is VALID [2022-04-28 01:29:23,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {2654#(< ~counter~0 17)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2654#(< ~counter~0 17)} is VALID [2022-04-28 01:29:23,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {2679#(< ~counter~0 16)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2654#(< ~counter~0 17)} is VALID [2022-04-28 01:29:23,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {2679#(< ~counter~0 16)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {2679#(< ~counter~0 16)} is VALID [2022-04-28 01:29:23,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {2679#(< ~counter~0 16)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2679#(< ~counter~0 16)} is VALID [2022-04-28 01:29:23,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2679#(< ~counter~0 16)} {2423#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2679#(< ~counter~0 16)} is VALID [2022-04-28 01:29:23,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {2679#(< ~counter~0 16)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2679#(< ~counter~0 16)} is VALID [2022-04-28 01:29:23,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {2423#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {2679#(< ~counter~0 16)} is VALID [2022-04-28 01:29:23,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {2423#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2423#true} is VALID [2022-04-28 01:29:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 01:29:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:29:23,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418389498] [2022-04-28 01:29:23,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:29:23,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955643018] [2022-04-28 01:29:23,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955643018] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 01:29:23,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 01:29:23,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 01:29:23,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699405651] [2022-04-28 01:29:23,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 01:29:23,125 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-28 01:29:23,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:29:23,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 01:29:23,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:23,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 01:29:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:29:23,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 01:29:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 01:29:23,182 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 01:29:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:23,637 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2022-04-28 01:29:23,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 01:29:23,637 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 44 [2022-04-28 01:29:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:29:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 01:29:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-28 01:29:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 01:29:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-28 01:29:23,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 123 transitions. [2022-04-28 01:29:23,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:23,739 INFO L225 Difference]: With dead ends: 123 [2022-04-28 01:29:23,739 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 01:29:23,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-28 01:29:23,740 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 120 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:29:23,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 148 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 01:29:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 01:29:23,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 93. [2022-04-28 01:29:23,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:29:23,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:23,788 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:23,788 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:23,791 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-28 01:29:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-28 01:29:23,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:23,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:23,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-28 01:29:23,792 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 118 states. [2022-04-28 01:29:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:23,795 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-28 01:29:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-28 01:29:23,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:23,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:23,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:29:23,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:29:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-04-28 01:29:23,799 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 44 [2022-04-28 01:29:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:29:23,800 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-04-28 01:29:23,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 01:29:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-04-28 01:29:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 01:29:23,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:29:23,801 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:29:23,825 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-28 01:29:24,015 WARN L477 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-28 01:29:24,016 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:29:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:29:24,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1805593115, now seen corresponding path program 4 times [2022-04-28 01:29:24,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:29:24,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356683388] [2022-04-28 01:29:24,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:29:24,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:29:24,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:29:24,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798132751] [2022-04-28 01:29:24,027 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 01:29:24,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:29:24,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:29:24,029 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-28 01:29:24,030 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-28 01:29:24,096 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 01:29:24,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:29:24,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 01:29:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:29:24,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:29:24,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {3256#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {3256#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {3256#true} is VALID [2022-04-28 01:29:24,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {3256#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3256#true} {3256#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {3256#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {3256#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:24,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:24,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:24,451 INFO L272 TraceCheckUtils]: 8: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3256#true} is VALID [2022-04-28 01:29:24,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {3256#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3256#true} is VALID [2022-04-28 01:29:24,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {3256#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {3256#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,452 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3256#true} {3276#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3276#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:24,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {3276#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:29:24,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:29:24,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:29:24,454 INFO L272 TraceCheckUtils]: 16: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3256#true} is VALID [2022-04-28 01:29:24,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {3256#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3256#true} is VALID [2022-04-28 01:29:24,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {3256#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {3256#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,455 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3256#true} {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:29:24,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {3301#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 01:29:24,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 01:29:24,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 01:29:24,460 INFO L272 TraceCheckUtils]: 24: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3256#true} is VALID [2022-04-28 01:29:24,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {3256#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3256#true} is VALID [2022-04-28 01:29:24,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {3256#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {3256#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,461 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3256#true} {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 01:29:24,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {3326#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:29:24,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:29:24,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:29:24,462 INFO L272 TraceCheckUtils]: 32: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3256#true} is VALID [2022-04-28 01:29:24,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {3256#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3256#true} is VALID [2022-04-28 01:29:24,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {3256#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {3256#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,465 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3256#true} {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:29:24,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {3351#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 01:29:24,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 01:29:24,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 01:29:24,467 INFO L272 TraceCheckUtils]: 40: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3256#true} is VALID [2022-04-28 01:29:24,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {3256#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3256#true} is VALID [2022-04-28 01:29:24,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {3256#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {3256#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-28 01:29:24,468 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3256#true} {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 01:29:24,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {3376#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {3401#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 01:29:24,469 INFO L272 TraceCheckUtils]: 46: Hoare triple {3401#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {3405#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:29:24,470 INFO L290 TraceCheckUtils]: 47: Hoare triple {3405#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3409#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:29:24,470 INFO L290 TraceCheckUtils]: 48: Hoare triple {3409#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3257#false} is VALID [2022-04-28 01:29:24,470 INFO L290 TraceCheckUtils]: 49: Hoare triple {3257#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3257#false} is VALID [2022-04-28 01:29:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 01:29:24,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:29:24,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:29:24,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356683388] [2022-04-28 01:29:24,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:29:24,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798132751] [2022-04-28 01:29:24,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798132751] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:29:24,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:29:24,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 01:29:24,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834307176] [2022-04-28 01:29:24,822 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:29:24,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-28 01:29:24,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:29:24,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:29:24,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:24,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 01:29:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:29:24,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 01:29:24,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 01:29:24,859 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:29:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:25,273 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-04-28 01:29:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 01:29:25,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-28 01:29:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:29:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:29:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-28 01:29:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:29:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-28 01:29:25,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-28 01:29:25,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:25,318 INFO L225 Difference]: With dead ends: 98 [2022-04-28 01:29:25,318 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 01:29:25,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-28 01:29:25,319 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:29:25,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 01:29:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 01:29:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 01:29:25,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:29:25,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:25,359 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:25,359 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:25,361 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-28 01:29:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-28 01:29:25,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:25,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:25,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-28 01:29:25,362 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-28 01:29:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:25,364 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-28 01:29:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-28 01:29:25,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:25,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:25,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:29:25,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:29:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2022-04-28 01:29:25,367 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 50 [2022-04-28 01:29:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:29:25,367 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2022-04-28 01:29:25,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:29:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-28 01:29:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 01:29:25,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:29:25,368 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:29:25,389 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-28 01:29:25,587 WARN L477 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-28 01:29:25,587 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:29:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:29:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1447431878, now seen corresponding path program 5 times [2022-04-28 01:29:25,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:29:25,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308827696] [2022-04-28 01:29:25,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:29:25,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:29:25,599 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:29:25,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476669602] [2022-04-28 01:29:25,599 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-28 01:29:25,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:29:25,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:29:25,600 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-28 01:29:25,610 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-28 01:29:25,793 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-28 01:29:25,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:29:25,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 01:29:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:29:25,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:29:26,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {3917#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {3917#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {3917#true} is VALID [2022-04-28 01:29:26,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {3917#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3917#true} {3917#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {3917#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {3917#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:26,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:26,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:26,196 INFO L272 TraceCheckUtils]: 8: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-28 01:29:26,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-28 01:29:26,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {3917#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {3917#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,197 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3917#true} {3937#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3937#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:26,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {3937#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:26,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:26,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:26,199 INFO L272 TraceCheckUtils]: 16: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-28 01:29:26,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {3917#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-28 01:29:26,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {3917#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {3917#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,200 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3917#true} {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:26,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {3962#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:26,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:26,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:26,201 INFO L272 TraceCheckUtils]: 24: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-28 01:29:26,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {3917#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-28 01:29:26,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {3917#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {3917#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,202 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3917#true} {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:26,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {3987#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 01:29:26,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 01:29:26,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 01:29:26,204 INFO L272 TraceCheckUtils]: 32: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-28 01:29:26,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {3917#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-28 01:29:26,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {3917#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {3917#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,205 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3917#true} {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 01:29:26,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {4012#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 01:29:26,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 01:29:26,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 01:29:26,207 INFO L272 TraceCheckUtils]: 40: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-28 01:29:26,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {3917#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-28 01:29:26,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {3917#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {3917#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,208 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3917#true} {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-28 01:29:26,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {4037#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 01:29:26,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 01:29:26,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 01:29:26,209 INFO L272 TraceCheckUtils]: 48: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {3917#true} is VALID [2022-04-28 01:29:26,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {3917#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3917#true} is VALID [2022-04-28 01:29:26,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {3917#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {3917#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-28 01:29:26,210 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3917#true} {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 01:29:26,211 INFO L290 TraceCheckUtils]: 53: Hoare triple {4062#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {4087#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-28 01:29:26,212 INFO L272 TraceCheckUtils]: 54: Hoare triple {4087#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {4091#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:29:26,212 INFO L290 TraceCheckUtils]: 55: Hoare triple {4091#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4095#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:29:26,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {4095#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3918#false} is VALID [2022-04-28 01:29:26,213 INFO L290 TraceCheckUtils]: 57: Hoare triple {3918#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3918#false} is VALID [2022-04-28 01:29:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 01:29:26,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:29:26,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:29:26,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308827696] [2022-04-28 01:29:26,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:29:26,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476669602] [2022-04-28 01:29:26,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476669602] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:29:26,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:29:26,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 01:29:26,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353537812] [2022-04-28 01:29:26,524 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:29:26,525 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-28 01:29:26,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:29:26,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:29:26,564 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-28 01:29:26,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 01:29:26,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:29:26,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 01:29:26,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 01:29:26,565 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:29:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:27,074 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-04-28 01:29:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 01:29:27,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-28 01:29:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:29:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:29:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-28 01:29:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:29:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-28 01:29:27,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-28 01:29:27,114 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-28 01:29:27,116 INFO L225 Difference]: With dead ends: 98 [2022-04-28 01:29:27,116 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 01:29:27,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 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-28 01:29:27,117 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 01:29:27,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 01:29:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 01:29:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 01:29:27,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:29:27,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:27,161 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:27,161 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:27,163 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-28 01:29:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-28 01:29:27,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:27,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:27,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-28 01:29:27,164 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-28 01:29:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:27,165 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-28 01:29:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-28 01:29:27,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:27,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:27,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:29:27,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:29:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-04-28 01:29:27,168 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 58 [2022-04-28 01:29:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:29:27,168 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-04-28 01:29:27,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:29:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-28 01:29:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 01:29:27,169 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:29:27,169 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:29:27,175 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-28 01:29:27,375 WARN L477 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-28 01:29:27,376 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:29:27,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:29:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1416046937, now seen corresponding path program 6 times [2022-04-28 01:29:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:29:27,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154658950] [2022-04-28 01:29:27,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:29:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:29:27,393 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:29:27,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861139463] [2022-04-28 01:29:27,393 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 01:29:27,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:29:27,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:29:27,395 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-28 01:29:27,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 01:29:27,613 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 01:29:27,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:29:27,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 01:29:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:29:27,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:29:28,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {4603#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {4603#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {4603#true} is VALID [2022-04-28 01:29:28,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {4603#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4603#true} {4603#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {4603#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {4603#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:28,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:28,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:28,114 INFO L272 TraceCheckUtils]: 8: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4603#true} is VALID [2022-04-28 01:29:28,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {4603#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4603#true} is VALID [2022-04-28 01:29:28,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {4603#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {4603#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,115 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4603#true} {4623#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4623#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:28,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {4623#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:28,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:28,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:28,117 INFO L272 TraceCheckUtils]: 16: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4603#true} is VALID [2022-04-28 01:29:28,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {4603#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4603#true} is VALID [2022-04-28 01:29:28,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {4603#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {4603#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,118 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4603#true} {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:29:28,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {4648#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 01:29:28,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 01:29:28,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 01:29:28,119 INFO L272 TraceCheckUtils]: 24: Hoare triple {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4603#true} is VALID [2022-04-28 01:29:28,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {4603#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4603#true} is VALID [2022-04-28 01:29:28,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {4603#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {4603#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,120 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4603#true} {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-28 01:29:28,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {4673#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 01:29:28,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 01:29:28,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 01:29:28,122 INFO L272 TraceCheckUtils]: 32: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4603#true} is VALID [2022-04-28 01:29:28,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {4603#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4603#true} is VALID [2022-04-28 01:29:28,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {4603#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {4603#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,123 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4603#true} {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 01:29:28,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (< 1 main_~k~0) (= main_~c~0 3))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 01:29:28,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 01:29:28,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 01:29:28,125 INFO L272 TraceCheckUtils]: 40: Hoare triple {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4603#true} is VALID [2022-04-28 01:29:28,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {4603#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4603#true} is VALID [2022-04-28 01:29:28,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {4603#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,126 INFO L290 TraceCheckUtils]: 43: Hoare triple {4603#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,126 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4603#true} {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 01:29:28,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {4723#(and (< 1 main_~k~0) (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-28 01:29:28,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-28 01:29:28,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-28 01:29:28,128 INFO L272 TraceCheckUtils]: 48: Hoare triple {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4603#true} is VALID [2022-04-28 01:29:28,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {4603#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4603#true} is VALID [2022-04-28 01:29:28,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {4603#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {4603#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,130 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4603#true} {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-28 01:29:28,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {4748#(and (< 1 main_~k~0) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 01:29:28,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 01:29:28,131 INFO L290 TraceCheckUtils]: 55: Hoare triple {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 01:29:28,131 INFO L272 TraceCheckUtils]: 56: Hoare triple {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4603#true} is VALID [2022-04-28 01:29:28,132 INFO L290 TraceCheckUtils]: 57: Hoare triple {4603#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4603#true} is VALID [2022-04-28 01:29:28,132 INFO L290 TraceCheckUtils]: 58: Hoare triple {4603#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {4603#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-28 01:29:28,133 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4603#true} {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-28 01:29:28,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {4773#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {4798#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-28 01:29:28,134 INFO L272 TraceCheckUtils]: 62: Hoare triple {4798#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {4802#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:29:28,135 INFO L290 TraceCheckUtils]: 63: Hoare triple {4802#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4806#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:29:28,135 INFO L290 TraceCheckUtils]: 64: Hoare triple {4806#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4604#false} is VALID [2022-04-28 01:29:28,135 INFO L290 TraceCheckUtils]: 65: Hoare triple {4604#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4604#false} is VALID [2022-04-28 01:29:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 01:29:28,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:29:29,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:29:29,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154658950] [2022-04-28 01:29:29,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:29:29,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861139463] [2022-04-28 01:29:29,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861139463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:29:29,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:29:29,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 01:29:29,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81108755] [2022-04-28 01:29:29,040 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:29:29,041 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-28 01:29:29,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:29:29,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:29:29,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:29,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 01:29:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:29:29,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 01:29:29,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-28 01:29:29,078 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:29:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:29,664 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-04-28 01:29:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 01:29:29,665 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-28 01:29:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:29:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:29:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-28 01:29:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:29:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-28 01:29:29,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-28 01:29:29,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:29,712 INFO L225 Difference]: With dead ends: 98 [2022-04-28 01:29:29,712 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 01:29:29,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-28 01:29:29,713 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 01:29:29,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 01:29:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 01:29:29,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 01:29:29,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:29:29,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:29,768 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:29,768 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:29,793 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-28 01:29:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-28 01:29:29,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:29,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:29,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-28 01:29:29,794 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-28 01:29:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:29,797 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-28 01:29:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-28 01:29:29,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:29,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:29,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:29:29,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:29:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-28 01:29:29,800 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 66 [2022-04-28 01:29:29,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:29:29,800 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-28 01:29:29,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 01:29:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-28 01:29:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 01:29:29,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:29:29,801 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:29:29,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 01:29:30,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 01:29:30,006 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:29:30,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:29:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash 291122568, now seen corresponding path program 7 times [2022-04-28 01:29:30,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:29:30,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173955967] [2022-04-28 01:29:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:29:30,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:29:30,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:29:30,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1548682117] [2022-04-28 01:29:30,034 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-28 01:29:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:29:30,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:29:30,037 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:29:30,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 01:29:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:29:30,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 01:29:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:29:30,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:29:31,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {5414#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {5414#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {5414#true} is VALID [2022-04-28 01:29:31,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {5414#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5414#true} {5414#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {5414#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {5414#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {5434#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:31,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {5434#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5434#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:31,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {5434#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5434#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:31,004 INFO L272 TraceCheckUtils]: 8: Hoare triple {5434#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5414#true} is VALID [2022-04-28 01:29:31,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {5414#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5414#true} is VALID [2022-04-28 01:29:31,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {5414#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {5414#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,005 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5414#true} {5434#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5434#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:31,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {5434#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 01:29:31,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 01:29:31,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 01:29:31,006 INFO L272 TraceCheckUtils]: 16: Hoare triple {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5414#true} is VALID [2022-04-28 01:29:31,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {5414#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5414#true} is VALID [2022-04-28 01:29:31,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {5414#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {5414#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,007 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5414#true} {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-28 01:29:31,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {5459#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,008 INFO L272 TraceCheckUtils]: 24: Hoare triple {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5414#true} is VALID [2022-04-28 01:29:31,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {5414#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5414#true} is VALID [2022-04-28 01:29:31,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {5414#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {5414#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,009 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5414#true} {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {5484#(and (= main_~y~0 2) (= main_~c~0 2) (< 0 main_~k~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 01:29:31,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 01:29:31,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 01:29:31,010 INFO L272 TraceCheckUtils]: 32: Hoare triple {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5414#true} is VALID [2022-04-28 01:29:31,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {5414#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5414#true} is VALID [2022-04-28 01:29:31,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {5414#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {5414#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,011 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5414#true} {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-28 01:29:31,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {5509#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,012 INFO L272 TraceCheckUtils]: 40: Hoare triple {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5414#true} is VALID [2022-04-28 01:29:31,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {5414#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5414#true} is VALID [2022-04-28 01:29:31,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {5414#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {5414#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,013 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5414#true} {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {5534#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4) (< 0 main_~k~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,014 INFO L272 TraceCheckUtils]: 48: Hoare triple {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5414#true} is VALID [2022-04-28 01:29:31,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {5414#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5414#true} is VALID [2022-04-28 01:29:31,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {5414#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {5414#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,014 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5414#true} {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,015 INFO L290 TraceCheckUtils]: 53: Hoare triple {5559#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 0 main_~k~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,016 INFO L272 TraceCheckUtils]: 56: Hoare triple {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5414#true} is VALID [2022-04-28 01:29:31,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {5414#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5414#true} is VALID [2022-04-28 01:29:31,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {5414#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,016 INFO L290 TraceCheckUtils]: 59: Hoare triple {5414#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,016 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5414#true} {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-28 01:29:31,017 INFO L290 TraceCheckUtils]: 61: Hoare triple {5584#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 01:29:31,017 INFO L290 TraceCheckUtils]: 62: Hoare triple {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 01:29:31,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 01:29:31,018 INFO L272 TraceCheckUtils]: 64: Hoare triple {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5414#true} is VALID [2022-04-28 01:29:31,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {5414#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5414#true} is VALID [2022-04-28 01:29:31,018 INFO L290 TraceCheckUtils]: 66: Hoare triple {5414#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,018 INFO L290 TraceCheckUtils]: 67: Hoare triple {5414#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5414#true} is VALID [2022-04-28 01:29:31,018 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5414#true} {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 01:29:31,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {5609#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {5634#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 01:29:31,020 INFO L272 TraceCheckUtils]: 70: Hoare triple {5634#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {5638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:29:31,020 INFO L290 TraceCheckUtils]: 71: Hoare triple {5638#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:29:31,020 INFO L290 TraceCheckUtils]: 72: Hoare triple {5642#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5415#false} is VALID [2022-04-28 01:29:31,020 INFO L290 TraceCheckUtils]: 73: Hoare triple {5415#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5415#false} is VALID [2022-04-28 01:29:31,021 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 01:29:31,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:29:31,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:29:31,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173955967] [2022-04-28 01:29:31,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:29:31,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548682117] [2022-04-28 01:29:31,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548682117] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:29:31,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:29:31,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 01:29:31,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110596033] [2022-04-28 01:29:31,925 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:29:31,925 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-28 01:29:31,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:29:31,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:29:31,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:31,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 01:29:31,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:29:31,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 01:29:31,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-28 01:29:31,964 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:29:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:32,680 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-04-28 01:29:32,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 01:29:32,680 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-28 01:29:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:29:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:29:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-28 01:29:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:29:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-28 01:29:32,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-28 01:29:32,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:29:32,735 INFO L225 Difference]: With dead ends: 98 [2022-04-28 01:29:32,735 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 01:29:32,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-28 01:29:32,736 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 01:29:32,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 01:29:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 01:29:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 01:29:32,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:29:32,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:32,789 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:32,790 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:32,791 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-28 01:29:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-28 01:29:32,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:32,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:32,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-28 01:29:32,792 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-28 01:29:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:32,794 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-28 01:29:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-28 01:29:32,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:32,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:32,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:29:32,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:29:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2022-04-28 01:29:32,796 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 74 [2022-04-28 01:29:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:29:32,797 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2022-04-28 01:29:32,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 01:29:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-28 01:29:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 01:29:32,797 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:29:32,798 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:29:32,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 01:29:33,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 01:29:33,007 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:29:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:29:33,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1938494313, now seen corresponding path program 8 times [2022-04-28 01:29:33,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:29:33,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816538704] [2022-04-28 01:29:33,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:29:33,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:29:33,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:29:33,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1800110680] [2022-04-28 01:29:33,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 01:29:33,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:29:33,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:29:33,024 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:29:33,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 01:29:33,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 01:29:33,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:29:33,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 01:29:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:29:33,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:29:33,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {6300#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:33,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {6300#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {6300#true} is VALID [2022-04-28 01:29:33,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {6300#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:33,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6300#true} {6300#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:33,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {6300#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {6300#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {6320#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:34,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {6320#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6320#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:34,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {6320#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6320#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:34,001 INFO L272 TraceCheckUtils]: 8: Hoare triple {6320#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6300#true} is VALID [2022-04-28 01:29:34,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {6300#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6300#true} is VALID [2022-04-28 01:29:34,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {6300#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {6300#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,001 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6300#true} {6320#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6320#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:34,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {6320#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:29:34,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:29:34,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:29:34,002 INFO L272 TraceCheckUtils]: 16: Hoare triple {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6300#true} is VALID [2022-04-28 01:29:34,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {6300#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6300#true} is VALID [2022-04-28 01:29:34,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {6300#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {6300#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,003 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6300#true} {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:29:34,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {6345#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6370#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 01:29:34,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {6370#(and (= main_~y~0 2) (= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6370#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 01:29:34,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {6370#(and (= main_~y~0 2) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6370#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 01:29:34,004 INFO L272 TraceCheckUtils]: 24: Hoare triple {6370#(and (= main_~y~0 2) (= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6300#true} is VALID [2022-04-28 01:29:34,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {6300#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6300#true} is VALID [2022-04-28 01:29:34,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {6300#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {6300#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,005 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6300#true} {6370#(and (= main_~y~0 2) (= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6370#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 01:29:34,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {6370#(and (= main_~y~0 2) (= main_~c~0 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6395#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:29:34,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {6395#(and (= main_~y~0 3) (= main_~c~0 3))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6395#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:29:34,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {6395#(and (= main_~y~0 3) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6395#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:29:34,006 INFO L272 TraceCheckUtils]: 32: Hoare triple {6395#(and (= main_~y~0 3) (= main_~c~0 3))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6300#true} is VALID [2022-04-28 01:29:34,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {6300#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6300#true} is VALID [2022-04-28 01:29:34,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {6300#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {6300#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,007 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6300#true} {6395#(and (= main_~y~0 3) (= main_~c~0 3))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6395#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:29:34,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {6395#(and (= main_~y~0 3) (= main_~c~0 3))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 01:29:34,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 01:29:34,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 01:29:34,008 INFO L272 TraceCheckUtils]: 40: Hoare triple {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6300#true} is VALID [2022-04-28 01:29:34,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {6300#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6300#true} is VALID [2022-04-28 01:29:34,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {6300#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {6300#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,009 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6300#true} {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 01:29:34,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {6420#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:29:34,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:29:34,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:29:34,010 INFO L272 TraceCheckUtils]: 48: Hoare triple {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6300#true} is VALID [2022-04-28 01:29:34,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {6300#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6300#true} is VALID [2022-04-28 01:29:34,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {6300#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {6300#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,011 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6300#true} {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:29:34,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {6445#(and (= 5 main_~c~0) (= 5 main_~y~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:29:34,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:29:34,012 INFO L290 TraceCheckUtils]: 55: Hoare triple {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:29:34,012 INFO L272 TraceCheckUtils]: 56: Hoare triple {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6300#true} is VALID [2022-04-28 01:29:34,012 INFO L290 TraceCheckUtils]: 57: Hoare triple {6300#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6300#true} is VALID [2022-04-28 01:29:34,012 INFO L290 TraceCheckUtils]: 58: Hoare triple {6300#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,012 INFO L290 TraceCheckUtils]: 59: Hoare triple {6300#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,012 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6300#true} {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:29:34,013 INFO L290 TraceCheckUtils]: 61: Hoare triple {6470#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:34,013 INFO L290 TraceCheckUtils]: 62: Hoare triple {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:34,014 INFO L290 TraceCheckUtils]: 63: Hoare triple {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:34,014 INFO L272 TraceCheckUtils]: 64: Hoare triple {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6300#true} is VALID [2022-04-28 01:29:34,014 INFO L290 TraceCheckUtils]: 65: Hoare triple {6300#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6300#true} is VALID [2022-04-28 01:29:34,014 INFO L290 TraceCheckUtils]: 66: Hoare triple {6300#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,014 INFO L290 TraceCheckUtils]: 67: Hoare triple {6300#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,017 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6300#true} {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:34,018 INFO L290 TraceCheckUtils]: 69: Hoare triple {6495#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 01:29:34,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 01:29:34,018 INFO L290 TraceCheckUtils]: 71: Hoare triple {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 01:29:34,019 INFO L272 TraceCheckUtils]: 72: Hoare triple {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6300#true} is VALID [2022-04-28 01:29:34,019 INFO L290 TraceCheckUtils]: 73: Hoare triple {6300#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6300#true} is VALID [2022-04-28 01:29:34,019 INFO L290 TraceCheckUtils]: 74: Hoare triple {6300#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,019 INFO L290 TraceCheckUtils]: 75: Hoare triple {6300#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6300#true} is VALID [2022-04-28 01:29:34,019 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6300#true} {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 01:29:34,020 INFO L290 TraceCheckUtils]: 77: Hoare triple {6520#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {6545#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 01:29:34,020 INFO L272 TraceCheckUtils]: 78: Hoare triple {6545#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {6549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:29:34,021 INFO L290 TraceCheckUtils]: 79: Hoare triple {6549#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:29:34,021 INFO L290 TraceCheckUtils]: 80: Hoare triple {6553#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {6301#false} is VALID [2022-04-28 01:29:34,021 INFO L290 TraceCheckUtils]: 81: Hoare triple {6301#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6301#false} is VALID [2022-04-28 01:29:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 01:29:34,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:29:34,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:29:34,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816538704] [2022-04-28 01:29:34,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:29:34,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800110680] [2022-04-28 01:29:34,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800110680] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:29:34,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:29:34,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 01:29:34,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525594777] [2022-04-28 01:29:34,316 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:29:34,317 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-28 01:29:34,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:29:34,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 01:29:34,369 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-28 01:29:34,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 01:29:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:29:34,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 01:29:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 01:29:34,370 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 01:29:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:35,225 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-04-28 01:29:35,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 01:29:35,225 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-28 01:29:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:29:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 01:29:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-28 01:29:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 01:29:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-28 01:29:35,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-28 01:29:35,279 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-28 01:29:35,280 INFO L225 Difference]: With dead ends: 98 [2022-04-28 01:29:35,280 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 01:29:35,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-28 01:29:35,281 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 01:29:35,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 408 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 01:29:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 01:29:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 01:29:35,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:29:35,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:35,330 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:35,330 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:35,331 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-28 01:29:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-28 01:29:35,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:35,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:35,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-28 01:29:35,332 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 93 states. [2022-04-28 01:29:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:29:35,334 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-28 01:29:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-28 01:29:35,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:29:35,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:29:35,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:29:35,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:29:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:29:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-04-28 01:29:35,336 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 82 [2022-04-28 01:29:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:29:35,336 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-04-28 01:29:35,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 01:29:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-28 01:29:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 01:29:35,337 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:29:35,337 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:29:35,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 01:29:35,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 01:29:35,544 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:29:35,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:29:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash 757893194, now seen corresponding path program 9 times [2022-04-28 01:29:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:29:35,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106482778] [2022-04-28 01:29:35,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:29:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:29:35,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:29:35,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426026777] [2022-04-28 01:29:35,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-28 01:29:35,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:29:35,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:29:35,561 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:29:35,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 01:29:35,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-28 01:29:35,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:29:36,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 01:29:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:29:36,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:29:36,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {7061#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {7061#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {7061#true} is VALID [2022-04-28 01:29:36,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {7061#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7061#true} {7061#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {7061#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {7061#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {7081#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:36,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {7081#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7081#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:36,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {7081#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7081#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:36,660 INFO L272 TraceCheckUtils]: 8: Hoare triple {7081#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7061#true} is VALID [2022-04-28 01:29:36,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {7061#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7061#true} is VALID [2022-04-28 01:29:36,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {7061#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {7061#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,668 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7061#true} {7081#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7081#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:29:36,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {7081#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7106#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 01:29:36,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {7106#(and (= main_~y~0 1) (= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7106#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 01:29:36,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {7106#(and (= main_~y~0 1) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7106#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 01:29:36,669 INFO L272 TraceCheckUtils]: 16: Hoare triple {7106#(and (= main_~y~0 1) (= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7061#true} is VALID [2022-04-28 01:29:36,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {7061#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7061#true} is VALID [2022-04-28 01:29:36,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {7061#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {7061#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,670 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7061#true} {7106#(and (= main_~y~0 1) (= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7106#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 01:29:36,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {7106#(and (= main_~y~0 1) (= main_~c~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 01:29:36,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 01:29:36,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 01:29:36,672 INFO L272 TraceCheckUtils]: 24: Hoare triple {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7061#true} is VALID [2022-04-28 01:29:36,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {7061#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7061#true} is VALID [2022-04-28 01:29:36,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {7061#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {7061#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,673 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7061#true} {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 01:29:36,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {7131#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 01:29:36,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 01:29:36,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 01:29:36,674 INFO L272 TraceCheckUtils]: 32: Hoare triple {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7061#true} is VALID [2022-04-28 01:29:36,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {7061#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7061#true} is VALID [2022-04-28 01:29:36,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {7061#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {7061#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,675 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7061#true} {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-28 01:29:36,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {7156#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 01:29:36,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 01:29:36,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 01:29:36,677 INFO L272 TraceCheckUtils]: 40: Hoare triple {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7061#true} is VALID [2022-04-28 01:29:36,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {7061#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7061#true} is VALID [2022-04-28 01:29:36,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {7061#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {7061#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,678 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7061#true} {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 01:29:36,678 INFO L290 TraceCheckUtils]: 45: Hoare triple {7181#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 01:29:36,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 01:29:36,679 INFO L290 TraceCheckUtils]: 47: Hoare triple {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 01:29:36,679 INFO L272 TraceCheckUtils]: 48: Hoare triple {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7061#true} is VALID [2022-04-28 01:29:36,679 INFO L290 TraceCheckUtils]: 49: Hoare triple {7061#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7061#true} is VALID [2022-04-28 01:29:36,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {7061#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {7061#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,680 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7061#true} {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-28 01:29:36,681 INFO L290 TraceCheckUtils]: 53: Hoare triple {7206#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:36,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:36,682 INFO L290 TraceCheckUtils]: 55: Hoare triple {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:36,682 INFO L272 TraceCheckUtils]: 56: Hoare triple {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7061#true} is VALID [2022-04-28 01:29:36,682 INFO L290 TraceCheckUtils]: 57: Hoare triple {7061#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7061#true} is VALID [2022-04-28 01:29:36,682 INFO L290 TraceCheckUtils]: 58: Hoare triple {7061#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,682 INFO L290 TraceCheckUtils]: 59: Hoare triple {7061#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,683 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7061#true} {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:29:36,683 INFO L290 TraceCheckUtils]: 61: Hoare triple {7231#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 01:29:36,684 INFO L290 TraceCheckUtils]: 62: Hoare triple {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 01:29:36,684 INFO L290 TraceCheckUtils]: 63: Hoare triple {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 01:29:36,684 INFO L272 TraceCheckUtils]: 64: Hoare triple {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7061#true} is VALID [2022-04-28 01:29:36,684 INFO L290 TraceCheckUtils]: 65: Hoare triple {7061#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7061#true} is VALID [2022-04-28 01:29:36,684 INFO L290 TraceCheckUtils]: 66: Hoare triple {7061#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {7061#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7061#true} is VALID [2022-04-28 01:29:36,685 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7061#true} {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-28 01:29:36,686 INFO L290 TraceCheckUtils]: 69: Hoare triple {7256#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 01:29:36,686 INFO L290 TraceCheckUtils]: 70: Hoare triple {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 01:29:36,687 INFO L290 TraceCheckUtils]: 71: Hoare triple {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} is VALID [2022-04-28 01:29:36,687 INFO L272 TraceCheckUtils]: 72: Hoare triple {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7061#true} is VALID [2022-04-28 01:29:36,687 INFO L290 TraceCheckUtils]: 73: Hoare triple {7061#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:29:36,687 INFO L290 TraceCheckUtils]: 74: Hoare triple {7294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:29:36,688 INFO L290 TraceCheckUtils]: 75: Hoare triple {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:29:36,689 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} {7281#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7305#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-28 01:29:36,689 INFO L290 TraceCheckUtils]: 77: Hoare triple {7305#(and (= main_~y~0 8) (= 4 (+ main_~c~0 (- 4))) (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 01:29:36,690 INFO L290 TraceCheckUtils]: 78: Hoare triple {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 01:29:36,691 INFO L290 TraceCheckUtils]: 79: Hoare triple {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 01:29:36,691 INFO L272 TraceCheckUtils]: 80: Hoare triple {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7061#true} is VALID [2022-04-28 01:29:36,691 INFO L290 TraceCheckUtils]: 81: Hoare triple {7061#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:29:36,691 INFO L290 TraceCheckUtils]: 82: Hoare triple {7294#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:29:36,692 INFO L290 TraceCheckUtils]: 83: Hoare triple {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:29:36,692 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7298#(not (= |__VERIFIER_assert_#in~cond| 0))} {7309#(and (= main_~y~0 9) (<= (+ (* main_~y~0 main_~y~0 main_~y~0) 1296) main_~x~0) (< 8 main_~k~0) (<= main_~c~0 9))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7331#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 01:29:36,693 INFO L290 TraceCheckUtils]: 85: Hoare triple {7331#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {7335#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 01:29:36,708 INFO L272 TraceCheckUtils]: 86: Hoare triple {7335#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {7339#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:29:36,709 INFO L290 TraceCheckUtils]: 87: Hoare triple {7339#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7343#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:29:36,709 INFO L290 TraceCheckUtils]: 88: Hoare triple {7343#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {7062#false} is VALID [2022-04-28 01:29:36,709 INFO L290 TraceCheckUtils]: 89: Hoare triple {7062#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7062#false} is VALID [2022-04-28 01:29:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-28 01:29:36,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:30:24,366 WARN L833 $PredicateComparison]: unable to prove that (or (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))))) (not (= 0 (mod (+ (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 13 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4)))) is different from false [2022-04-28 01:30:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:30:24,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106482778] [2022-04-28 01:30:24,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:30:24,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426026777] [2022-04-28 01:30:24,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426026777] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:30:24,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:30:24,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-28 01:30:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803264051] [2022-04-28 01:30:24,369 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:30:24,369 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-28 01:30:24,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:30:24,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:30:24,418 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-28 01:30:24,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 01:30:24,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:30:24,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 01:30:24,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=472, Unknown=8, NotChecked=44, Total=600 [2022-04-28 01:30:24,419 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:30:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:25,723 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-28 01:30:25,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 01:30:25,723 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 90 [2022-04-28 01:30:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:30:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:30:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-28 01:30:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:30:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-28 01:30:25,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2022-04-28 01:30:25,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:30:25,785 INFO L225 Difference]: With dead ends: 100 [2022-04-28 01:30:25,785 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 01:30:25,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=97, Invalid=601, Unknown=8, NotChecked=50, Total=756 [2022-04-28 01:30:25,786 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 01:30:25,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 454 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 01:30:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 01:30:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-28 01:30:25,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:30:25,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 01:30:25,856 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 01:30:25,856 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 01:30:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:25,858 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-28 01:30:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-28 01:30:25,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:30:25,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:30:25,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-28 01:30:25,859 INFO L87 Difference]: Start difference. First operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 95 states. [2022-04-28 01:30:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:25,861 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-28 01:30:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-28 01:30:25,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:30:25,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:30:25,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:30:25,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:30:25,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 69 states have internal predecessors, (71), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 01:30:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-04-28 01:30:25,863 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 90 [2022-04-28 01:30:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:30:25,864 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-04-28 01:30:25,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 16 states have internal predecessors, (42), 12 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 01:30:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-28 01:30:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 01:30:25,865 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:30:25,865 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:30:25,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 01:30:26,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:30:26,070 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:30:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:30:26,071 INFO L85 PathProgramCache]: Analyzing trace with hash -953190739, now seen corresponding path program 3 times [2022-04-28 01:30:26,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:30:26,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451785522] [2022-04-28 01:30:26,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:30:26,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:30:26,084 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:30:26,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [237544529] [2022-04-28 01:30:26,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-28 01:30:26,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:30:26,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:30:26,085 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:30:26,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 01:30:26,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-28 01:30:26,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:30:26,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 01:30:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:30:26,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:30:26,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {7866#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:26,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {7866#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {7874#(<= ~counter~0 0)} is VALID [2022-04-28 01:30:26,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {7874#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7874#(<= ~counter~0 0)} is VALID [2022-04-28 01:30:26,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7874#(<= ~counter~0 0)} {7866#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7874#(<= ~counter~0 0)} is VALID [2022-04-28 01:30:26,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {7874#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7874#(<= ~counter~0 0)} is VALID [2022-04-28 01:30:26,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {7874#(<= ~counter~0 0)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {7874#(<= ~counter~0 0)} is VALID [2022-04-28 01:30:26,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {7874#(<= ~counter~0 0)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7890#(<= ~counter~0 1)} is VALID [2022-04-28 01:30:26,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {7890#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7890#(<= ~counter~0 1)} is VALID [2022-04-28 01:30:26,674 INFO L272 TraceCheckUtils]: 8: Hoare triple {7890#(<= ~counter~0 1)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7890#(<= ~counter~0 1)} is VALID [2022-04-28 01:30:26,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {7890#(<= ~counter~0 1)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7890#(<= ~counter~0 1)} is VALID [2022-04-28 01:30:26,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {7890#(<= ~counter~0 1)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7890#(<= ~counter~0 1)} is VALID [2022-04-28 01:30:26,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {7890#(<= ~counter~0 1)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7890#(<= ~counter~0 1)} is VALID [2022-04-28 01:30:26,676 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7890#(<= ~counter~0 1)} {7890#(<= ~counter~0 1)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7890#(<= ~counter~0 1)} is VALID [2022-04-28 01:30:26,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {7890#(<= ~counter~0 1)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7890#(<= ~counter~0 1)} is VALID [2022-04-28 01:30:26,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {7890#(<= ~counter~0 1)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7915#(<= ~counter~0 2)} is VALID [2022-04-28 01:30:26,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {7915#(<= ~counter~0 2)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7915#(<= ~counter~0 2)} is VALID [2022-04-28 01:30:26,678 INFO L272 TraceCheckUtils]: 16: Hoare triple {7915#(<= ~counter~0 2)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7915#(<= ~counter~0 2)} is VALID [2022-04-28 01:30:26,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {7915#(<= ~counter~0 2)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7915#(<= ~counter~0 2)} is VALID [2022-04-28 01:30:26,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {7915#(<= ~counter~0 2)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7915#(<= ~counter~0 2)} is VALID [2022-04-28 01:30:26,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {7915#(<= ~counter~0 2)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7915#(<= ~counter~0 2)} is VALID [2022-04-28 01:30:26,679 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7915#(<= ~counter~0 2)} {7915#(<= ~counter~0 2)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7915#(<= ~counter~0 2)} is VALID [2022-04-28 01:30:26,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {7915#(<= ~counter~0 2)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7915#(<= ~counter~0 2)} is VALID [2022-04-28 01:30:26,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {7915#(<= ~counter~0 2)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7940#(<= ~counter~0 3)} is VALID [2022-04-28 01:30:26,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {7940#(<= ~counter~0 3)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7940#(<= ~counter~0 3)} is VALID [2022-04-28 01:30:26,680 INFO L272 TraceCheckUtils]: 24: Hoare triple {7940#(<= ~counter~0 3)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7940#(<= ~counter~0 3)} is VALID [2022-04-28 01:30:26,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {7940#(<= ~counter~0 3)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7940#(<= ~counter~0 3)} is VALID [2022-04-28 01:30:26,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {7940#(<= ~counter~0 3)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7940#(<= ~counter~0 3)} is VALID [2022-04-28 01:30:26,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {7940#(<= ~counter~0 3)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7940#(<= ~counter~0 3)} is VALID [2022-04-28 01:30:26,682 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7940#(<= ~counter~0 3)} {7940#(<= ~counter~0 3)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7940#(<= ~counter~0 3)} is VALID [2022-04-28 01:30:26,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {7940#(<= ~counter~0 3)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7940#(<= ~counter~0 3)} is VALID [2022-04-28 01:30:26,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {7940#(<= ~counter~0 3)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7965#(<= ~counter~0 4)} is VALID [2022-04-28 01:30:26,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {7965#(<= ~counter~0 4)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7965#(<= ~counter~0 4)} is VALID [2022-04-28 01:30:26,683 INFO L272 TraceCheckUtils]: 32: Hoare triple {7965#(<= ~counter~0 4)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7965#(<= ~counter~0 4)} is VALID [2022-04-28 01:30:26,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {7965#(<= ~counter~0 4)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7965#(<= ~counter~0 4)} is VALID [2022-04-28 01:30:26,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {7965#(<= ~counter~0 4)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7965#(<= ~counter~0 4)} is VALID [2022-04-28 01:30:26,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {7965#(<= ~counter~0 4)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7965#(<= ~counter~0 4)} is VALID [2022-04-28 01:30:26,688 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7965#(<= ~counter~0 4)} {7965#(<= ~counter~0 4)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7965#(<= ~counter~0 4)} is VALID [2022-04-28 01:30:26,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {7965#(<= ~counter~0 4)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7965#(<= ~counter~0 4)} is VALID [2022-04-28 01:30:26,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {7965#(<= ~counter~0 4)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {7990#(<= ~counter~0 5)} is VALID [2022-04-28 01:30:26,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {7990#(<= ~counter~0 5)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7990#(<= ~counter~0 5)} is VALID [2022-04-28 01:30:26,689 INFO L272 TraceCheckUtils]: 40: Hoare triple {7990#(<= ~counter~0 5)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7990#(<= ~counter~0 5)} is VALID [2022-04-28 01:30:26,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {7990#(<= ~counter~0 5)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7990#(<= ~counter~0 5)} is VALID [2022-04-28 01:30:26,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {7990#(<= ~counter~0 5)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7990#(<= ~counter~0 5)} is VALID [2022-04-28 01:30:26,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {7990#(<= ~counter~0 5)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7990#(<= ~counter~0 5)} is VALID [2022-04-28 01:30:26,691 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7990#(<= ~counter~0 5)} {7990#(<= ~counter~0 5)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7990#(<= ~counter~0 5)} is VALID [2022-04-28 01:30:26,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {7990#(<= ~counter~0 5)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {7990#(<= ~counter~0 5)} is VALID [2022-04-28 01:30:26,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {7990#(<= ~counter~0 5)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8015#(<= ~counter~0 6)} is VALID [2022-04-28 01:30:26,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {8015#(<= ~counter~0 6)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8015#(<= ~counter~0 6)} is VALID [2022-04-28 01:30:26,693 INFO L272 TraceCheckUtils]: 48: Hoare triple {8015#(<= ~counter~0 6)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8015#(<= ~counter~0 6)} is VALID [2022-04-28 01:30:26,693 INFO L290 TraceCheckUtils]: 49: Hoare triple {8015#(<= ~counter~0 6)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8015#(<= ~counter~0 6)} is VALID [2022-04-28 01:30:26,694 INFO L290 TraceCheckUtils]: 50: Hoare triple {8015#(<= ~counter~0 6)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {8015#(<= ~counter~0 6)} is VALID [2022-04-28 01:30:26,694 INFO L290 TraceCheckUtils]: 51: Hoare triple {8015#(<= ~counter~0 6)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8015#(<= ~counter~0 6)} is VALID [2022-04-28 01:30:26,695 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8015#(<= ~counter~0 6)} {8015#(<= ~counter~0 6)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8015#(<= ~counter~0 6)} is VALID [2022-04-28 01:30:26,695 INFO L290 TraceCheckUtils]: 53: Hoare triple {8015#(<= ~counter~0 6)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8015#(<= ~counter~0 6)} is VALID [2022-04-28 01:30:26,696 INFO L290 TraceCheckUtils]: 54: Hoare triple {8015#(<= ~counter~0 6)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8040#(<= ~counter~0 7)} is VALID [2022-04-28 01:30:26,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {8040#(<= ~counter~0 7)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8040#(<= ~counter~0 7)} is VALID [2022-04-28 01:30:26,697 INFO L272 TraceCheckUtils]: 56: Hoare triple {8040#(<= ~counter~0 7)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8040#(<= ~counter~0 7)} is VALID [2022-04-28 01:30:26,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {8040#(<= ~counter~0 7)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8040#(<= ~counter~0 7)} is VALID [2022-04-28 01:30:26,697 INFO L290 TraceCheckUtils]: 58: Hoare triple {8040#(<= ~counter~0 7)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {8040#(<= ~counter~0 7)} is VALID [2022-04-28 01:30:26,698 INFO L290 TraceCheckUtils]: 59: Hoare triple {8040#(<= ~counter~0 7)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8040#(<= ~counter~0 7)} is VALID [2022-04-28 01:30:26,698 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8040#(<= ~counter~0 7)} {8040#(<= ~counter~0 7)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8040#(<= ~counter~0 7)} is VALID [2022-04-28 01:30:26,699 INFO L290 TraceCheckUtils]: 61: Hoare triple {8040#(<= ~counter~0 7)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8040#(<= ~counter~0 7)} is VALID [2022-04-28 01:30:26,699 INFO L290 TraceCheckUtils]: 62: Hoare triple {8040#(<= ~counter~0 7)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8065#(<= ~counter~0 8)} is VALID [2022-04-28 01:30:26,700 INFO L290 TraceCheckUtils]: 63: Hoare triple {8065#(<= ~counter~0 8)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8065#(<= ~counter~0 8)} is VALID [2022-04-28 01:30:26,700 INFO L272 TraceCheckUtils]: 64: Hoare triple {8065#(<= ~counter~0 8)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8065#(<= ~counter~0 8)} is VALID [2022-04-28 01:30:26,701 INFO L290 TraceCheckUtils]: 65: Hoare triple {8065#(<= ~counter~0 8)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8065#(<= ~counter~0 8)} is VALID [2022-04-28 01:30:26,701 INFO L290 TraceCheckUtils]: 66: Hoare triple {8065#(<= ~counter~0 8)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {8065#(<= ~counter~0 8)} is VALID [2022-04-28 01:30:26,702 INFO L290 TraceCheckUtils]: 67: Hoare triple {8065#(<= ~counter~0 8)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8065#(<= ~counter~0 8)} is VALID [2022-04-28 01:30:26,702 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8065#(<= ~counter~0 8)} {8065#(<= ~counter~0 8)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8065#(<= ~counter~0 8)} is VALID [2022-04-28 01:30:26,703 INFO L290 TraceCheckUtils]: 69: Hoare triple {8065#(<= ~counter~0 8)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8065#(<= ~counter~0 8)} is VALID [2022-04-28 01:30:26,703 INFO L290 TraceCheckUtils]: 70: Hoare triple {8065#(<= ~counter~0 8)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:26,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {8090#(<= ~counter~0 9)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:26,704 INFO L272 TraceCheckUtils]: 72: Hoare triple {8090#(<= ~counter~0 9)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:26,705 INFO L290 TraceCheckUtils]: 73: Hoare triple {8090#(<= ~counter~0 9)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:26,705 INFO L290 TraceCheckUtils]: 74: Hoare triple {8090#(<= ~counter~0 9)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:26,705 INFO L290 TraceCheckUtils]: 75: Hoare triple {8090#(<= ~counter~0 9)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:26,706 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8090#(<= ~counter~0 9)} {8090#(<= ~counter~0 9)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:26,706 INFO L290 TraceCheckUtils]: 77: Hoare triple {8090#(<= ~counter~0 9)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:26,707 INFO L290 TraceCheckUtils]: 78: Hoare triple {8090#(<= ~counter~0 9)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:26,707 INFO L290 TraceCheckUtils]: 79: Hoare triple {8115#(<= ~counter~0 10)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:26,708 INFO L272 TraceCheckUtils]: 80: Hoare triple {8115#(<= ~counter~0 10)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:26,708 INFO L290 TraceCheckUtils]: 81: Hoare triple {8115#(<= ~counter~0 10)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:26,708 INFO L290 TraceCheckUtils]: 82: Hoare triple {8115#(<= ~counter~0 10)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:26,709 INFO L290 TraceCheckUtils]: 83: Hoare triple {8115#(<= ~counter~0 10)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:26,709 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {8115#(<= ~counter~0 10)} {8115#(<= ~counter~0 10)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:26,710 INFO L290 TraceCheckUtils]: 85: Hoare triple {8115#(<= ~counter~0 10)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:26,710 INFO L290 TraceCheckUtils]: 86: Hoare triple {8115#(<= ~counter~0 10)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8140#(<= |main_#t~post5| 10)} is VALID [2022-04-28 01:30:26,711 INFO L290 TraceCheckUtils]: 87: Hoare triple {8140#(<= |main_#t~post5| 10)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 20)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7867#false} is VALID [2022-04-28 01:30:26,711 INFO L272 TraceCheckUtils]: 88: Hoare triple {7867#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {7867#false} is VALID [2022-04-28 01:30:26,711 INFO L290 TraceCheckUtils]: 89: Hoare triple {7867#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7867#false} is VALID [2022-04-28 01:30:26,711 INFO L290 TraceCheckUtils]: 90: Hoare triple {7867#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {7867#false} is VALID [2022-04-28 01:30:26,711 INFO L290 TraceCheckUtils]: 91: Hoare triple {7867#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7867#false} is VALID [2022-04-28 01:30:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 01:30:26,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:30:27,222 INFO L290 TraceCheckUtils]: 91: Hoare triple {7867#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7867#false} is VALID [2022-04-28 01:30:27,223 INFO L290 TraceCheckUtils]: 90: Hoare triple {7867#false} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {7867#false} is VALID [2022-04-28 01:30:27,223 INFO L290 TraceCheckUtils]: 89: Hoare triple {7867#false} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7867#false} is VALID [2022-04-28 01:30:27,223 INFO L272 TraceCheckUtils]: 88: Hoare triple {7867#false} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {7867#false} is VALID [2022-04-28 01:30:27,223 INFO L290 TraceCheckUtils]: 87: Hoare triple {8168#(< |main_#t~post5| 20)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 20)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7867#false} is VALID [2022-04-28 01:30:27,223 INFO L290 TraceCheckUtils]: 86: Hoare triple {8172#(< ~counter~0 20)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8168#(< |main_#t~post5| 20)} is VALID [2022-04-28 01:30:27,224 INFO L290 TraceCheckUtils]: 85: Hoare triple {8172#(< ~counter~0 20)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8172#(< ~counter~0 20)} is VALID [2022-04-28 01:30:27,224 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7866#true} {8172#(< ~counter~0 20)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8172#(< ~counter~0 20)} is VALID [2022-04-28 01:30:27,224 INFO L290 TraceCheckUtils]: 83: Hoare triple {7866#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,224 INFO L290 TraceCheckUtils]: 82: Hoare triple {7866#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,224 INFO L290 TraceCheckUtils]: 81: Hoare triple {7866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7866#true} is VALID [2022-04-28 01:30:27,225 INFO L272 TraceCheckUtils]: 80: Hoare triple {8172#(< ~counter~0 20)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7866#true} is VALID [2022-04-28 01:30:27,227 INFO L290 TraceCheckUtils]: 79: Hoare triple {8172#(< ~counter~0 20)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8172#(< ~counter~0 20)} is VALID [2022-04-28 01:30:27,228 INFO L290 TraceCheckUtils]: 78: Hoare triple {8197#(< ~counter~0 19)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8172#(< ~counter~0 20)} is VALID [2022-04-28 01:30:27,228 INFO L290 TraceCheckUtils]: 77: Hoare triple {8197#(< ~counter~0 19)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8197#(< ~counter~0 19)} is VALID [2022-04-28 01:30:27,229 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7866#true} {8197#(< ~counter~0 19)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8197#(< ~counter~0 19)} is VALID [2022-04-28 01:30:27,229 INFO L290 TraceCheckUtils]: 75: Hoare triple {7866#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,229 INFO L290 TraceCheckUtils]: 74: Hoare triple {7866#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,229 INFO L290 TraceCheckUtils]: 73: Hoare triple {7866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7866#true} is VALID [2022-04-28 01:30:27,229 INFO L272 TraceCheckUtils]: 72: Hoare triple {8197#(< ~counter~0 19)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7866#true} is VALID [2022-04-28 01:30:27,230 INFO L290 TraceCheckUtils]: 71: Hoare triple {8197#(< ~counter~0 19)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8197#(< ~counter~0 19)} is VALID [2022-04-28 01:30:27,230 INFO L290 TraceCheckUtils]: 70: Hoare triple {8222#(< ~counter~0 18)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8197#(< ~counter~0 19)} is VALID [2022-04-28 01:30:27,231 INFO L290 TraceCheckUtils]: 69: Hoare triple {8222#(< ~counter~0 18)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8222#(< ~counter~0 18)} is VALID [2022-04-28 01:30:27,231 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7866#true} {8222#(< ~counter~0 18)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8222#(< ~counter~0 18)} is VALID [2022-04-28 01:30:27,231 INFO L290 TraceCheckUtils]: 67: Hoare triple {7866#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {7866#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {7866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7866#true} is VALID [2022-04-28 01:30:27,232 INFO L272 TraceCheckUtils]: 64: Hoare triple {8222#(< ~counter~0 18)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7866#true} is VALID [2022-04-28 01:30:27,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {8222#(< ~counter~0 18)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8222#(< ~counter~0 18)} is VALID [2022-04-28 01:30:27,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {8247#(< ~counter~0 17)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8222#(< ~counter~0 18)} is VALID [2022-04-28 01:30:27,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {8247#(< ~counter~0 17)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8247#(< ~counter~0 17)} is VALID [2022-04-28 01:30:27,234 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7866#true} {8247#(< ~counter~0 17)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8247#(< ~counter~0 17)} is VALID [2022-04-28 01:30:27,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {7866#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {7866#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {7866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7866#true} is VALID [2022-04-28 01:30:27,234 INFO L272 TraceCheckUtils]: 56: Hoare triple {8247#(< ~counter~0 17)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7866#true} is VALID [2022-04-28 01:30:27,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {8247#(< ~counter~0 17)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8247#(< ~counter~0 17)} is VALID [2022-04-28 01:30:27,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {8272#(< ~counter~0 16)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8247#(< ~counter~0 17)} is VALID [2022-04-28 01:30:27,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {8272#(< ~counter~0 16)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8272#(< ~counter~0 16)} is VALID [2022-04-28 01:30:27,236 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7866#true} {8272#(< ~counter~0 16)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8272#(< ~counter~0 16)} is VALID [2022-04-28 01:30:27,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {7866#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {7866#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {7866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7866#true} is VALID [2022-04-28 01:30:27,237 INFO L272 TraceCheckUtils]: 48: Hoare triple {8272#(< ~counter~0 16)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7866#true} is VALID [2022-04-28 01:30:27,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {8272#(< ~counter~0 16)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8272#(< ~counter~0 16)} is VALID [2022-04-28 01:30:27,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {8297#(< ~counter~0 15)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8272#(< ~counter~0 16)} is VALID [2022-04-28 01:30:27,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {8297#(< ~counter~0 15)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8297#(< ~counter~0 15)} is VALID [2022-04-28 01:30:27,239 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7866#true} {8297#(< ~counter~0 15)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8297#(< ~counter~0 15)} is VALID [2022-04-28 01:30:27,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {7866#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {7866#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {7866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7866#true} is VALID [2022-04-28 01:30:27,239 INFO L272 TraceCheckUtils]: 40: Hoare triple {8297#(< ~counter~0 15)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7866#true} is VALID [2022-04-28 01:30:27,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {8297#(< ~counter~0 15)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8297#(< ~counter~0 15)} is VALID [2022-04-28 01:30:27,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {8322#(< ~counter~0 14)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8297#(< ~counter~0 15)} is VALID [2022-04-28 01:30:27,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {8322#(< ~counter~0 14)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8322#(< ~counter~0 14)} is VALID [2022-04-28 01:30:27,241 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7866#true} {8322#(< ~counter~0 14)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8322#(< ~counter~0 14)} is VALID [2022-04-28 01:30:27,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {7866#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {7866#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {7866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7866#true} is VALID [2022-04-28 01:30:27,241 INFO L272 TraceCheckUtils]: 32: Hoare triple {8322#(< ~counter~0 14)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7866#true} is VALID [2022-04-28 01:30:27,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {8322#(< ~counter~0 14)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8322#(< ~counter~0 14)} is VALID [2022-04-28 01:30:27,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {8347#(< ~counter~0 13)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8322#(< ~counter~0 14)} is VALID [2022-04-28 01:30:27,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {8347#(< ~counter~0 13)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8347#(< ~counter~0 13)} is VALID [2022-04-28 01:30:27,243 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7866#true} {8347#(< ~counter~0 13)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8347#(< ~counter~0 13)} is VALID [2022-04-28 01:30:27,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {7866#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {7866#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {7866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7866#true} is VALID [2022-04-28 01:30:27,243 INFO L272 TraceCheckUtils]: 24: Hoare triple {8347#(< ~counter~0 13)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7866#true} is VALID [2022-04-28 01:30:27,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {8347#(< ~counter~0 13)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8347#(< ~counter~0 13)} is VALID [2022-04-28 01:30:27,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {8372#(< ~counter~0 12)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8347#(< ~counter~0 13)} is VALID [2022-04-28 01:30:27,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {8372#(< ~counter~0 12)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8372#(< ~counter~0 12)} is VALID [2022-04-28 01:30:27,245 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7866#true} {8372#(< ~counter~0 12)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8372#(< ~counter~0 12)} is VALID [2022-04-28 01:30:27,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {7866#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {7866#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {7866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7866#true} is VALID [2022-04-28 01:30:27,246 INFO L272 TraceCheckUtils]: 16: Hoare triple {8372#(< ~counter~0 12)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7866#true} is VALID [2022-04-28 01:30:27,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {8372#(< ~counter~0 12)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8372#(< ~counter~0 12)} is VALID [2022-04-28 01:30:27,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {8115#(<= ~counter~0 10)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8372#(< ~counter~0 12)} is VALID [2022-04-28 01:30:27,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {8115#(<= ~counter~0 10)} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:27,248 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7866#true} {8115#(<= ~counter~0 10)} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:27,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {7866#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {7866#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {7866#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7866#true} is VALID [2022-04-28 01:30:27,248 INFO L272 TraceCheckUtils]: 8: Hoare triple {8115#(<= ~counter~0 10)} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {7866#true} is VALID [2022-04-28 01:30:27,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {8115#(<= ~counter~0 10)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:27,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {8090#(<= ~counter~0 9)} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {8115#(<= ~counter~0 10)} is VALID [2022-04-28 01:30:27,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {8090#(<= ~counter~0 9)} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:27,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {8090#(<= ~counter~0 9)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:27,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8090#(<= ~counter~0 9)} {7866#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:27,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {8090#(<= ~counter~0 9)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:27,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {7866#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {8090#(<= ~counter~0 9)} is VALID [2022-04-28 01:30:27,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {7866#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7866#true} is VALID [2022-04-28 01:30:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 01:30:27,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:30:27,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451785522] [2022-04-28 01:30:27,252 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:30:27,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237544529] [2022-04-28 01:30:27,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237544529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 01:30:27,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 01:30:27,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-28 01:30:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585923830] [2022-04-28 01:30:27,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 01:30:27,253 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) Word has length 92 [2022-04-28 01:30:27,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:30:27,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-04-28 01:30:27,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:30:27,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 01:30:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:30:27,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 01:30:27,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 01:30:27,362 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-04-28 01:30:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:28,247 INFO L93 Difference]: Finished difference Result 223 states and 233 transitions. [2022-04-28 01:30:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 01:30:28,247 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) Word has length 92 [2022-04-28 01:30:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:30:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-04-28 01:30:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 223 transitions. [2022-04-28 01:30:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-04-28 01:30:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 223 transitions. [2022-04-28 01:30:28,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 223 transitions. [2022-04-28 01:30:28,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:30:28,461 INFO L225 Difference]: With dead ends: 223 [2022-04-28 01:30:28,461 INFO L226 Difference]: Without dead ends: 218 [2022-04-28 01:30:28,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 01:30:28,462 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 192 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 01:30:28,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 213 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 01:30:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-28 01:30:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 173. [2022-04-28 01:30:28,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:30:28,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:28,559 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:28,559 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:28,563 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2022-04-28 01:30:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 219 transitions. [2022-04-28 01:30:28,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:30:28,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:30:28,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 218 states. [2022-04-28 01:30:28,565 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 218 states. [2022-04-28 01:30:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:28,569 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2022-04-28 01:30:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 219 transitions. [2022-04-28 01:30:28,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:30:28,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:30:28,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:30:28,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:30:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2022-04-28 01:30:28,574 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 92 [2022-04-28 01:30:28,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:30:28,575 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2022-04-28 01:30:28,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-04-28 01:30:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2022-04-28 01:30:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 01:30:28,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:30:28,576 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:30:28,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 01:30:28,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 01:30:28,794 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:30:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:30:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash 138382379, now seen corresponding path program 10 times [2022-04-28 01:30:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:30:28,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901989173] [2022-04-28 01:30:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:30:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:30:28,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:30:28,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088098031] [2022-04-28 01:30:28,810 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 01:30:28,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:30:28,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:30:28,811 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:30:28,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 01:30:30,168 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 01:30:30,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:30:30,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 01:30:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:30:30,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:30:30,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {9465#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {9465#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {9465#true} is VALID [2022-04-28 01:30:30,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {9465#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9465#true} {9465#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {9465#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {9465#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {9485#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:30,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {9485#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {9485#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:30,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {9485#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9485#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:30,720 INFO L272 TraceCheckUtils]: 8: Hoare triple {9485#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9465#true} is VALID [2022-04-28 01:30:30,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {9465#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9465#true} is VALID [2022-04-28 01:30:30,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {9465#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {9465#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,721 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9465#true} {9485#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9485#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:30,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {9485#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:30:30,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:30:30,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:30:30,722 INFO L272 TraceCheckUtils]: 16: Hoare triple {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9465#true} is VALID [2022-04-28 01:30:30,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {9465#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9465#true} is VALID [2022-04-28 01:30:30,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {9465#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {9465#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,723 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9465#true} {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:30:30,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {9510#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 01:30:30,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 01:30:30,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 01:30:30,724 INFO L272 TraceCheckUtils]: 24: Hoare triple {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9465#true} is VALID [2022-04-28 01:30:30,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {9465#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9465#true} is VALID [2022-04-28 01:30:30,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {9465#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {9465#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,725 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9465#true} {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 01:30:30,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {9535#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {9560#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:30:30,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {9560#(and (= main_~y~0 3) (= main_~c~0 3))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {9560#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:30:30,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {9560#(and (= main_~y~0 3) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9560#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:30:30,726 INFO L272 TraceCheckUtils]: 32: Hoare triple {9560#(and (= main_~y~0 3) (= main_~c~0 3))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9465#true} is VALID [2022-04-28 01:30:30,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {9465#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9465#true} is VALID [2022-04-28 01:30:30,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {9465#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {9465#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,727 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9465#true} {9560#(and (= main_~y~0 3) (= main_~c~0 3))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9560#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:30:30,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {9560#(and (= main_~y~0 3) (= main_~c~0 3))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:30:30,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:30:30,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:30:30,728 INFO L272 TraceCheckUtils]: 40: Hoare triple {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9465#true} is VALID [2022-04-28 01:30:30,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {9465#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9465#true} is VALID [2022-04-28 01:30:30,728 INFO L290 TraceCheckUtils]: 42: Hoare triple {9465#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {9465#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,728 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9465#true} {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:30:30,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {9585#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:30,729 INFO L290 TraceCheckUtils]: 46: Hoare triple {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:30,730 INFO L290 TraceCheckUtils]: 47: Hoare triple {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:30,730 INFO L272 TraceCheckUtils]: 48: Hoare triple {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9465#true} is VALID [2022-04-28 01:30:30,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {9465#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9465#true} is VALID [2022-04-28 01:30:30,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {9465#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {9465#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,730 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9465#true} {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:30,731 INFO L290 TraceCheckUtils]: 53: Hoare triple {9610#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:30:30,731 INFO L290 TraceCheckUtils]: 54: Hoare triple {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:30:30,731 INFO L290 TraceCheckUtils]: 55: Hoare triple {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:30:30,732 INFO L272 TraceCheckUtils]: 56: Hoare triple {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9465#true} is VALID [2022-04-28 01:30:30,732 INFO L290 TraceCheckUtils]: 57: Hoare triple {9465#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9465#true} is VALID [2022-04-28 01:30:30,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {9465#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,732 INFO L290 TraceCheckUtils]: 59: Hoare triple {9465#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,732 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9465#true} {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:30:30,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {9635#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 01:30:30,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 01:30:30,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 01:30:30,733 INFO L272 TraceCheckUtils]: 64: Hoare triple {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9465#true} is VALID [2022-04-28 01:30:30,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {9465#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9465#true} is VALID [2022-04-28 01:30:30,734 INFO L290 TraceCheckUtils]: 66: Hoare triple {9465#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,734 INFO L290 TraceCheckUtils]: 67: Hoare triple {9465#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,734 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9465#true} {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-28 01:30:30,735 INFO L290 TraceCheckUtils]: 69: Hoare triple {9660#(and (= (+ (- 2) main_~y~0) 5) (= (+ (- 1) main_~c~0) 6))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:30,735 INFO L290 TraceCheckUtils]: 70: Hoare triple {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:30,736 INFO L290 TraceCheckUtils]: 71: Hoare triple {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:30,736 INFO L272 TraceCheckUtils]: 72: Hoare triple {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9465#true} is VALID [2022-04-28 01:30:30,736 INFO L290 TraceCheckUtils]: 73: Hoare triple {9465#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9465#true} is VALID [2022-04-28 01:30:30,736 INFO L290 TraceCheckUtils]: 74: Hoare triple {9465#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,736 INFO L290 TraceCheckUtils]: 75: Hoare triple {9465#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,737 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9465#true} {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:30,737 INFO L290 TraceCheckUtils]: 77: Hoare triple {9685#(and (= (+ main_~y~0 (- 3)) 5) (= 6 (+ (- 2) main_~c~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-28 01:30:30,738 INFO L290 TraceCheckUtils]: 78: Hoare triple {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-28 01:30:30,738 INFO L290 TraceCheckUtils]: 79: Hoare triple {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-28 01:30:30,738 INFO L272 TraceCheckUtils]: 80: Hoare triple {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9465#true} is VALID [2022-04-28 01:30:30,738 INFO L290 TraceCheckUtils]: 81: Hoare triple {9465#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9465#true} is VALID [2022-04-28 01:30:30,738 INFO L290 TraceCheckUtils]: 82: Hoare triple {9465#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,738 INFO L290 TraceCheckUtils]: 83: Hoare triple {9465#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,739 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {9465#true} {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} is VALID [2022-04-28 01:30:30,739 INFO L290 TraceCheckUtils]: 85: Hoare triple {9710#(and (= (+ main_~c~0 (- 3)) 6) (= main_~y~0 9))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 01:30:30,740 INFO L290 TraceCheckUtils]: 86: Hoare triple {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 01:30:30,740 INFO L290 TraceCheckUtils]: 87: Hoare triple {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 01:30:30,740 INFO L272 TraceCheckUtils]: 88: Hoare triple {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9465#true} is VALID [2022-04-28 01:30:30,740 INFO L290 TraceCheckUtils]: 89: Hoare triple {9465#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9465#true} is VALID [2022-04-28 01:30:30,740 INFO L290 TraceCheckUtils]: 90: Hoare triple {9465#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,740 INFO L290 TraceCheckUtils]: 91: Hoare triple {9465#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9465#true} is VALID [2022-04-28 01:30:30,741 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {9465#true} {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 01:30:30,741 INFO L290 TraceCheckUtils]: 93: Hoare triple {9735#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~c~0 10) (< 9 main_~k~0))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {9760#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 10) (< 9 main_~k~0))} is VALID [2022-04-28 01:30:30,742 INFO L272 TraceCheckUtils]: 94: Hoare triple {9760#(and (= 9 (+ (- 1) main_~y~0)) (<= main_~k~0 10) (< 9 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {9764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:30:30,742 INFO L290 TraceCheckUtils]: 95: Hoare triple {9764#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:30:30,742 INFO L290 TraceCheckUtils]: 96: Hoare triple {9768#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {9466#false} is VALID [2022-04-28 01:30:30,743 INFO L290 TraceCheckUtils]: 97: Hoare triple {9466#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9466#false} is VALID [2022-04-28 01:30:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 22 proven. 220 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 01:30:30,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:30:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:30:31,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901989173] [2022-04-28 01:30:31,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:30:31,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088098031] [2022-04-28 01:30:31,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088098031] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:30:31,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:30:31,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 01:30:31,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236580664] [2022-04-28 01:30:31,056 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:30:31,057 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 98 [2022-04-28 01:30:31,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:30:31,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 01:30:31,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:30:31,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 01:30:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:30:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 01:30:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 01:30:31,110 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 01:30:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:32,314 INFO L93 Difference]: Finished difference Result 178 states and 187 transitions. [2022-04-28 01:30:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 01:30:32,314 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 98 [2022-04-28 01:30:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:30:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 01:30:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-28 01:30:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 01:30:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-28 01:30:32,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 79 transitions. [2022-04-28 01:30:32,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:30:32,399 INFO L225 Difference]: With dead ends: 178 [2022-04-28 01:30:32,400 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 01:30:32,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-28 01:30:32,400 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 01:30:32,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 532 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 01:30:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 01:30:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-28 01:30:32,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:30:32,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:32,510 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:32,510 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:32,513 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2022-04-28 01:30:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 182 transitions. [2022-04-28 01:30:32,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:30:32,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:30:32,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:30:32,514 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:30:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:32,520 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2022-04-28 01:30:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 182 transitions. [2022-04-28 01:30:32,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:30:32,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:30:32,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:30:32,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:30:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.078125) internal successors, (138), 128 states have internal predecessors, (138), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 182 transitions. [2022-04-28 01:30:32,524 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 182 transitions. Word has length 98 [2022-04-28 01:30:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:30:32,525 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 182 transitions. [2022-04-28 01:30:32,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 13 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 01:30:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 182 transitions. [2022-04-28 01:30:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 01:30:32,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:30:32,527 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:30:32,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 01:30:32,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 01:30:32,734 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:30:32,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:30:32,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1036328716, now seen corresponding path program 11 times [2022-04-28 01:30:32,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:30:32,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863363546] [2022-04-28 01:30:32,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:30:32,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:30:32,748 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:30:32,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946720392] [2022-04-28 01:30:32,748 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-28 01:30:32,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:30:32,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:30:32,749 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:30:32,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 01:30:33,305 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-28 01:30:33,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:30:33,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 01:30:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:30:33,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:30:33,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {10656#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {10656#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {10656#true} is VALID [2022-04-28 01:30:33,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {10656#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10656#true} {10656#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {10656#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {10656#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {10676#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:33,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {10676#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10676#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:33,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {10676#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10676#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:33,931 INFO L272 TraceCheckUtils]: 8: Hoare triple {10676#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,932 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10656#true} {10676#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10676#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:33,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {10676#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:30:33,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:30:33,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:30:33,933 INFO L272 TraceCheckUtils]: 16: Hoare triple {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,934 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10656#true} {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 01:30:33,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {10701#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:33,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:33,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:33,935 INFO L272 TraceCheckUtils]: 24: Hoare triple {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,936 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10656#true} {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:33,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {10726#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 01:30:33,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 01:30:33,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 01:30:33,937 INFO L272 TraceCheckUtils]: 32: Hoare triple {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,938 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10656#true} {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 01:30:33,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {10751#(and (= (+ main_~c~0 (- 3)) 0) (= (+ main_~y~0 (- 3)) 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {10776#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 01:30:33,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {10776#(and (= main_~y~0 4) (= main_~c~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10776#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 01:30:33,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {10776#(and (= main_~y~0 4) (= main_~c~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10776#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 01:30:33,939 INFO L272 TraceCheckUtils]: 40: Hoare triple {10776#(and (= main_~y~0 4) (= main_~c~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,940 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10656#true} {10776#(and (= main_~y~0 4) (= main_~c~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10776#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 01:30:33,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {10776#(and (= main_~y~0 4) (= main_~c~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:33,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:33,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:33,941 INFO L272 TraceCheckUtils]: 48: Hoare triple {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,941 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10656#true} {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:33,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {10801#(and (= 5 main_~c~0) (= 5 main_~y~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 01:30:33,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 01:30:33,942 INFO L290 TraceCheckUtils]: 55: Hoare triple {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 01:30:33,943 INFO L272 TraceCheckUtils]: 56: Hoare triple {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,943 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10656#true} {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 01:30:33,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {10826#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:33,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:33,944 INFO L290 TraceCheckUtils]: 63: Hoare triple {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:33,951 INFO L272 TraceCheckUtils]: 64: Hoare triple {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,951 INFO L290 TraceCheckUtils]: 65: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,951 INFO L290 TraceCheckUtils]: 66: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,951 INFO L290 TraceCheckUtils]: 67: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,952 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10656#true} {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:33,952 INFO L290 TraceCheckUtils]: 69: Hoare triple {10851#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 01:30:33,952 INFO L290 TraceCheckUtils]: 70: Hoare triple {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 01:30:33,953 INFO L290 TraceCheckUtils]: 71: Hoare triple {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 01:30:33,953 INFO L272 TraceCheckUtils]: 72: Hoare triple {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,953 INFO L290 TraceCheckUtils]: 73: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,953 INFO L290 TraceCheckUtils]: 74: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,953 INFO L290 TraceCheckUtils]: 75: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,954 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10656#true} {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-28 01:30:33,954 INFO L290 TraceCheckUtils]: 77: Hoare triple {10876#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {10901#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:30:33,954 INFO L290 TraceCheckUtils]: 78: Hoare triple {10901#(and (= main_~y~0 9) (= main_~c~0 9))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10901#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:30:33,955 INFO L290 TraceCheckUtils]: 79: Hoare triple {10901#(and (= main_~y~0 9) (= main_~c~0 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10901#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:30:33,955 INFO L272 TraceCheckUtils]: 80: Hoare triple {10901#(and (= main_~y~0 9) (= main_~c~0 9))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,955 INFO L290 TraceCheckUtils]: 81: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,955 INFO L290 TraceCheckUtils]: 82: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,955 INFO L290 TraceCheckUtils]: 83: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,955 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {10656#true} {10901#(and (= main_~y~0 9) (= main_~c~0 9))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10901#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:30:33,956 INFO L290 TraceCheckUtils]: 85: Hoare triple {10901#(and (= main_~y~0 9) (= main_~c~0 9))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {10926#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:33,956 INFO L290 TraceCheckUtils]: 86: Hoare triple {10926#(and (= main_~y~0 10) (= main_~c~0 10))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10926#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:33,957 INFO L290 TraceCheckUtils]: 87: Hoare triple {10926#(and (= main_~y~0 10) (= main_~c~0 10))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10926#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:33,957 INFO L272 TraceCheckUtils]: 88: Hoare triple {10926#(and (= main_~y~0 10) (= main_~c~0 10))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,957 INFO L290 TraceCheckUtils]: 89: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,957 INFO L290 TraceCheckUtils]: 90: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,957 INFO L290 TraceCheckUtils]: 91: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,957 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {10656#true} {10926#(and (= main_~y~0 10) (= main_~c~0 10))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10926#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:33,958 INFO L290 TraceCheckUtils]: 93: Hoare triple {10926#(and (= main_~y~0 10) (= main_~c~0 10))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 01:30:33,958 INFO L290 TraceCheckUtils]: 94: Hoare triple {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 01:30:33,958 INFO L290 TraceCheckUtils]: 95: Hoare triple {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 01:30:33,959 INFO L272 TraceCheckUtils]: 96: Hoare triple {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10656#true} is VALID [2022-04-28 01:30:33,959 INFO L290 TraceCheckUtils]: 97: Hoare triple {10656#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10656#true} is VALID [2022-04-28 01:30:33,959 INFO L290 TraceCheckUtils]: 98: Hoare triple {10656#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,959 INFO L290 TraceCheckUtils]: 99: Hoare triple {10656#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10656#true} is VALID [2022-04-28 01:30:33,959 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {10656#true} {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 01:30:33,960 INFO L290 TraceCheckUtils]: 101: Hoare triple {10951#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ (- 1) main_~y~0) 10))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {10976#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 01:30:33,961 INFO L272 TraceCheckUtils]: 102: Hoare triple {10976#(and (< 10 main_~k~0) (<= main_~k~0 11) (= (+ (- 1) main_~y~0) 10))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {10980#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:30:33,961 INFO L290 TraceCheckUtils]: 103: Hoare triple {10980#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10984#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:30:33,961 INFO L290 TraceCheckUtils]: 104: Hoare triple {10984#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {10657#false} is VALID [2022-04-28 01:30:33,962 INFO L290 TraceCheckUtils]: 105: Hoare triple {10657#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10657#false} is VALID [2022-04-28 01:30:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 24 proven. 264 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 01:30:33,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:30:34,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:30:34,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863363546] [2022-04-28 01:30:34,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:30:34,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946720392] [2022-04-28 01:30:34,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946720392] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:30:34,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:30:34,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 01:30:34,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636168168] [2022-04-28 01:30:34,231 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:30:34,231 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 106 [2022-04-28 01:30:34,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:30:34,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 01:30:34,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:30:34,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 01:30:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:30:34,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 01:30:34,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-28 01:30:34,288 INFO L87 Difference]: Start difference. First operand 173 states and 182 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 01:30:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:35,775 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2022-04-28 01:30:35,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 01:30:35,775 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 106 [2022-04-28 01:30:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:30:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 01:30:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-28 01:30:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 01:30:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-28 01:30:35,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 84 transitions. [2022-04-28 01:30:35,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:30:35,855 INFO L225 Difference]: With dead ends: 178 [2022-04-28 01:30:35,855 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 01:30:35,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-28 01:30:35,856 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 01:30:35,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 600 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 01:30:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 01:30:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-28 01:30:35,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:30:35,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:35,973 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:35,973 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:35,976 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2022-04-28 01:30:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 181 transitions. [2022-04-28 01:30:35,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:30:35,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:30:35,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:30:35,977 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:30:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:35,979 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2022-04-28 01:30:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 181 transitions. [2022-04-28 01:30:35,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:30:35,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:30:35,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:30:35,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:30:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0703125) internal successors, (137), 128 states have internal predecessors, (137), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 181 transitions. [2022-04-28 01:30:35,983 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 181 transitions. Word has length 106 [2022-04-28 01:30:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:30:35,983 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 181 transitions. [2022-04-28 01:30:35,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 14 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 01:30:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 181 transitions. [2022-04-28 01:30:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 01:30:35,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:30:35,984 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:30:35,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 01:30:36,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 01:30:36,195 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:30:36,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:30:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1975402733, now seen corresponding path program 12 times [2022-04-28 01:30:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:30:36,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175432863] [2022-04-28 01:30:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:30:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:30:36,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:30:36,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263302977] [2022-04-28 01:30:36,215 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 01:30:36,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:30:36,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:30:36,216 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:30:36,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 01:30:36,785 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 01:30:36,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:30:36,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 01:30:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:30:36,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:30:37,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {11872#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {11872#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {11872#true} is VALID [2022-04-28 01:30:37,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {11872#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11872#true} {11872#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {11872#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {11872#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {11892#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:37,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {11892#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {11892#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:37,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {11892#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11892#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:37,400 INFO L272 TraceCheckUtils]: 8: Hoare triple {11892#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,401 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11872#true} {11892#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11892#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:37,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {11892#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:30:37,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:30:37,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:30:37,403 INFO L272 TraceCheckUtils]: 16: Hoare triple {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,403 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11872#true} {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:30:37,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {11917#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 01:30:37,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 01:30:37,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 01:30:37,405 INFO L272 TraceCheckUtils]: 24: Hoare triple {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,405 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11872#true} {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-28 01:30:37,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {11942#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 01:30:37,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 01:30:37,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 01:30:37,407 INFO L272 TraceCheckUtils]: 32: Hoare triple {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,412 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11872#true} {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-28 01:30:37,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {11967#(and (= (+ (- 2) main_~c~0) 1) (= (+ main_~y~0 (- 3)) 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 01:30:37,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 01:30:37,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 01:30:37,414 INFO L272 TraceCheckUtils]: 40: Hoare triple {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,415 INFO L290 TraceCheckUtils]: 41: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,415 INFO L290 TraceCheckUtils]: 42: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,415 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {11872#true} {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-28 01:30:37,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {11992#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 01:30:37,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 01:30:37,416 INFO L290 TraceCheckUtils]: 47: Hoare triple {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 01:30:37,416 INFO L272 TraceCheckUtils]: 48: Hoare triple {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,416 INFO L290 TraceCheckUtils]: 49: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,416 INFO L290 TraceCheckUtils]: 50: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,417 INFO L290 TraceCheckUtils]: 51: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,417 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11872#true} {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 01:30:37,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {12017#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 01:30:37,418 INFO L290 TraceCheckUtils]: 54: Hoare triple {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 01:30:37,418 INFO L290 TraceCheckUtils]: 55: Hoare triple {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 01:30:37,418 INFO L272 TraceCheckUtils]: 56: Hoare triple {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,419 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11872#true} {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 01:30:37,419 INFO L290 TraceCheckUtils]: 61: Hoare triple {12042#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:37,420 INFO L290 TraceCheckUtils]: 62: Hoare triple {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:37,420 INFO L290 TraceCheckUtils]: 63: Hoare triple {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:37,420 INFO L272 TraceCheckUtils]: 64: Hoare triple {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,420 INFO L290 TraceCheckUtils]: 65: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,420 INFO L290 TraceCheckUtils]: 66: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,420 INFO L290 TraceCheckUtils]: 67: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,421 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11872#true} {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 01:30:37,421 INFO L290 TraceCheckUtils]: 69: Hoare triple {12067#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {12092#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 01:30:37,421 INFO L290 TraceCheckUtils]: 70: Hoare triple {12092#(and (= main_~y~0 8) (= main_~c~0 8))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {12092#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 01:30:37,422 INFO L290 TraceCheckUtils]: 71: Hoare triple {12092#(and (= main_~y~0 8) (= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12092#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 01:30:37,422 INFO L272 TraceCheckUtils]: 72: Hoare triple {12092#(and (= main_~y~0 8) (= main_~c~0 8))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,422 INFO L290 TraceCheckUtils]: 73: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,422 INFO L290 TraceCheckUtils]: 75: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,423 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {11872#true} {12092#(and (= main_~y~0 8) (= main_~c~0 8))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {12092#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 01:30:37,423 INFO L290 TraceCheckUtils]: 77: Hoare triple {12092#(and (= main_~y~0 8) (= main_~c~0 8))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {12117#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:30:37,423 INFO L290 TraceCheckUtils]: 78: Hoare triple {12117#(and (= main_~y~0 9) (= main_~c~0 9))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {12117#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:30:37,424 INFO L290 TraceCheckUtils]: 79: Hoare triple {12117#(and (= main_~y~0 9) (= main_~c~0 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12117#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:30:37,424 INFO L272 TraceCheckUtils]: 80: Hoare triple {12117#(and (= main_~y~0 9) (= main_~c~0 9))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,424 INFO L290 TraceCheckUtils]: 81: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,424 INFO L290 TraceCheckUtils]: 83: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,424 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {11872#true} {12117#(and (= main_~y~0 9) (= main_~c~0 9))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {12117#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:30:37,425 INFO L290 TraceCheckUtils]: 85: Hoare triple {12117#(and (= main_~y~0 9) (= main_~c~0 9))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {12142#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:37,425 INFO L290 TraceCheckUtils]: 86: Hoare triple {12142#(and (= main_~y~0 10) (= main_~c~0 10))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {12142#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:37,425 INFO L290 TraceCheckUtils]: 87: Hoare triple {12142#(and (= main_~y~0 10) (= main_~c~0 10))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12142#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:37,426 INFO L272 TraceCheckUtils]: 88: Hoare triple {12142#(and (= main_~y~0 10) (= main_~c~0 10))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,426 INFO L290 TraceCheckUtils]: 89: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,426 INFO L290 TraceCheckUtils]: 90: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,426 INFO L290 TraceCheckUtils]: 91: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,426 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {11872#true} {12142#(and (= main_~y~0 10) (= main_~c~0 10))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {12142#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:37,427 INFO L290 TraceCheckUtils]: 93: Hoare triple {12142#(and (= main_~y~0 10) (= main_~c~0 10))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 01:30:37,427 INFO L290 TraceCheckUtils]: 94: Hoare triple {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 01:30:37,427 INFO L290 TraceCheckUtils]: 95: Hoare triple {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 01:30:37,427 INFO L272 TraceCheckUtils]: 96: Hoare triple {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,427 INFO L290 TraceCheckUtils]: 97: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,428 INFO L290 TraceCheckUtils]: 98: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,428 INFO L290 TraceCheckUtils]: 99: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,428 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {11872#true} {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-28 01:30:37,428 INFO L290 TraceCheckUtils]: 101: Hoare triple {12167#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 01:30:37,429 INFO L290 TraceCheckUtils]: 102: Hoare triple {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 01:30:37,429 INFO L290 TraceCheckUtils]: 103: Hoare triple {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 01:30:37,429 INFO L272 TraceCheckUtils]: 104: Hoare triple {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {11872#true} is VALID [2022-04-28 01:30:37,429 INFO L290 TraceCheckUtils]: 105: Hoare triple {11872#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11872#true} is VALID [2022-04-28 01:30:37,429 INFO L290 TraceCheckUtils]: 106: Hoare triple {11872#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,429 INFO L290 TraceCheckUtils]: 107: Hoare triple {11872#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11872#true} is VALID [2022-04-28 01:30:37,430 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {11872#true} {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-28 01:30:37,430 INFO L290 TraceCheckUtils]: 109: Hoare triple {12192#(and (= main_~y~0 12) (<= main_~c~0 12) (< 11 main_~k~0))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {12217#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-28 01:30:37,431 INFO L272 TraceCheckUtils]: 110: Hoare triple {12217#(and (= main_~y~0 12) (< 11 main_~k~0) (<= main_~k~0 12))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {12221#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:30:37,431 INFO L290 TraceCheckUtils]: 111: Hoare triple {12221#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {12225#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:30:37,432 INFO L290 TraceCheckUtils]: 112: Hoare triple {12225#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {11873#false} is VALID [2022-04-28 01:30:37,432 INFO L290 TraceCheckUtils]: 113: Hoare triple {11873#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11873#false} is VALID [2022-04-28 01:30:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 26 proven. 312 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 01:30:37,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:30:37,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:30:37,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175432863] [2022-04-28 01:30:37,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:30:37,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263302977] [2022-04-28 01:30:37,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263302977] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:30:37,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:30:37,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-28 01:30:37,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869478912] [2022-04-28 01:30:37,776 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:30:37,777 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 114 [2022-04-28 01:30:37,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:30:37,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 01:30:37,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:30:37,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 01:30:37,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:30:37,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 01:30:37,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-28 01:30:37,837 INFO L87 Difference]: Start difference. First operand 173 states and 181 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 01:30:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:39,591 INFO L93 Difference]: Finished difference Result 178 states and 185 transitions. [2022-04-28 01:30:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 01:30:39,592 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 114 [2022-04-28 01:30:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:30:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 01:30:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-28 01:30:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 01:30:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-28 01:30:39,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 89 transitions. [2022-04-28 01:30:39,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:30:39,678 INFO L225 Difference]: With dead ends: 178 [2022-04-28 01:30:39,678 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 01:30:39,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-04-28 01:30:39,679 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 01:30:39,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 672 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 01:30:39,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 01:30:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-28 01:30:39,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:30:39,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:39,794 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:39,795 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:39,797 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2022-04-28 01:30:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2022-04-28 01:30:39,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:30:39,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:30:39,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:30:39,799 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:30:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:30:39,802 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2022-04-28 01:30:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2022-04-28 01:30:39,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:30:39,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:30:39,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:30:39,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:30:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0625) internal successors, (136), 128 states have internal predecessors, (136), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:30:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 180 transitions. [2022-04-28 01:30:39,807 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 180 transitions. Word has length 114 [2022-04-28 01:30:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:30:39,808 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 180 transitions. [2022-04-28 01:30:39,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 15 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 01:30:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2022-04-28 01:30:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 01:30:39,809 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:30:39,809 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:30:39,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 01:30:40,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:30:40,015 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:30:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:30:40,015 INFO L85 PathProgramCache]: Analyzing trace with hash -953421362, now seen corresponding path program 13 times [2022-04-28 01:30:40,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:30:40,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492599338] [2022-04-28 01:30:40,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:30:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:30:40,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:30:40,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508256372] [2022-04-28 01:30:40,029 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-28 01:30:40,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:30:40,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:30:40,030 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:30:40,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 01:30:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:30:41,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-28 01:30:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:30:41,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:30:41,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {13113#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {13113#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {13113#true} is VALID [2022-04-28 01:30:41,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {13113#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13113#true} {13113#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {13113#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {13113#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {13133#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:41,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {13133#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13133#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:41,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {13133#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13133#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:41,786 INFO L272 TraceCheckUtils]: 8: Hoare triple {13133#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,787 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13113#true} {13133#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13133#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:30:41,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {13133#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13158#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 01:30:41,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {13158#(and (= main_~y~0 1) (= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13158#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 01:30:41,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {13158#(and (= main_~y~0 1) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13158#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 01:30:41,788 INFO L272 TraceCheckUtils]: 16: Hoare triple {13158#(and (= main_~y~0 1) (= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,789 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13113#true} {13158#(and (= main_~y~0 1) (= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13158#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 01:30:41,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {13158#(and (= main_~y~0 1) (= main_~c~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 01:30:41,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 01:30:41,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 01:30:41,790 INFO L272 TraceCheckUtils]: 24: Hoare triple {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,790 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13113#true} {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 01:30:41,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {13183#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:30:41,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:30:41,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:30:41,793 INFO L272 TraceCheckUtils]: 32: Hoare triple {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,795 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13113#true} {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:30:41,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {13208#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 01:30:41,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 01:30:41,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 01:30:41,797 INFO L272 TraceCheckUtils]: 40: Hoare triple {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,798 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13113#true} {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 01:30:41,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {13233#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:41,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:41,799 INFO L290 TraceCheckUtils]: 47: Hoare triple {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:41,799 INFO L272 TraceCheckUtils]: 48: Hoare triple {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,799 INFO L290 TraceCheckUtils]: 50: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,799 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13113#true} {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 01:30:41,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {13258#(and (= 5 main_~c~0) (= 5 main_~y~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13283#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:30:41,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {13283#(and (= main_~y~0 6) (= main_~c~0 6))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13283#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:30:41,800 INFO L290 TraceCheckUtils]: 55: Hoare triple {13283#(and (= main_~y~0 6) (= main_~c~0 6))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13283#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:30:41,801 INFO L272 TraceCheckUtils]: 56: Hoare triple {13283#(and (= main_~y~0 6) (= main_~c~0 6))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,801 INFO L290 TraceCheckUtils]: 59: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,801 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13113#true} {13283#(and (= main_~y~0 6) (= main_~c~0 6))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13283#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:30:41,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {13283#(and (= main_~y~0 6) (= main_~c~0 6))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 01:30:41,802 INFO L290 TraceCheckUtils]: 62: Hoare triple {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 01:30:41,802 INFO L290 TraceCheckUtils]: 63: Hoare triple {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 01:30:41,802 INFO L272 TraceCheckUtils]: 64: Hoare triple {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,803 INFO L290 TraceCheckUtils]: 65: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,803 INFO L290 TraceCheckUtils]: 66: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,803 INFO L290 TraceCheckUtils]: 67: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,805 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13113#true} {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 01:30:41,805 INFO L290 TraceCheckUtils]: 69: Hoare triple {13308#(and (= 7 main_~y~0) (= 7 main_~c~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13333#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 01:30:41,806 INFO L290 TraceCheckUtils]: 70: Hoare triple {13333#(and (= main_~y~0 8) (= main_~c~0 8))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13333#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 01:30:41,806 INFO L290 TraceCheckUtils]: 71: Hoare triple {13333#(and (= main_~y~0 8) (= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13333#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 01:30:41,806 INFO L272 TraceCheckUtils]: 72: Hoare triple {13333#(and (= main_~y~0 8) (= main_~c~0 8))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,806 INFO L290 TraceCheckUtils]: 73: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,806 INFO L290 TraceCheckUtils]: 74: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,806 INFO L290 TraceCheckUtils]: 75: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,807 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13113#true} {13333#(and (= main_~y~0 8) (= main_~c~0 8))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13333#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-28 01:30:41,807 INFO L290 TraceCheckUtils]: 77: Hoare triple {13333#(and (= main_~y~0 8) (= main_~c~0 8))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 01:30:41,807 INFO L290 TraceCheckUtils]: 78: Hoare triple {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 01:30:41,808 INFO L290 TraceCheckUtils]: 79: Hoare triple {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 01:30:41,808 INFO L272 TraceCheckUtils]: 80: Hoare triple {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,808 INFO L290 TraceCheckUtils]: 81: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,808 INFO L290 TraceCheckUtils]: 82: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,808 INFO L290 TraceCheckUtils]: 83: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,809 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {13113#true} {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 01:30:41,809 INFO L290 TraceCheckUtils]: 85: Hoare triple {13358#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13383#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:41,809 INFO L290 TraceCheckUtils]: 86: Hoare triple {13383#(and (= main_~y~0 10) (= main_~c~0 10))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13383#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:41,810 INFO L290 TraceCheckUtils]: 87: Hoare triple {13383#(and (= main_~y~0 10) (= main_~c~0 10))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13383#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:41,810 INFO L272 TraceCheckUtils]: 88: Hoare triple {13383#(and (= main_~y~0 10) (= main_~c~0 10))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,810 INFO L290 TraceCheckUtils]: 89: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,810 INFO L290 TraceCheckUtils]: 90: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,810 INFO L290 TraceCheckUtils]: 91: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,810 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {13113#true} {13383#(and (= main_~y~0 10) (= main_~c~0 10))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13383#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-28 01:30:41,811 INFO L290 TraceCheckUtils]: 93: Hoare triple {13383#(and (= main_~y~0 10) (= main_~c~0 10))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13408#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:30:41,811 INFO L290 TraceCheckUtils]: 94: Hoare triple {13408#(and (= main_~c~0 11) (= main_~y~0 11))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13408#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:30:41,811 INFO L290 TraceCheckUtils]: 95: Hoare triple {13408#(and (= main_~c~0 11) (= main_~y~0 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13408#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:30:41,812 INFO L272 TraceCheckUtils]: 96: Hoare triple {13408#(and (= main_~c~0 11) (= main_~y~0 11))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,812 INFO L290 TraceCheckUtils]: 97: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,812 INFO L290 TraceCheckUtils]: 98: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,812 INFO L290 TraceCheckUtils]: 99: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,812 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {13113#true} {13408#(and (= main_~c~0 11) (= main_~y~0 11))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13408#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:30:41,813 INFO L290 TraceCheckUtils]: 101: Hoare triple {13408#(and (= main_~c~0 11) (= main_~y~0 11))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 01:30:41,813 INFO L290 TraceCheckUtils]: 102: Hoare triple {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 01:30:41,813 INFO L290 TraceCheckUtils]: 103: Hoare triple {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 01:30:41,813 INFO L272 TraceCheckUtils]: 104: Hoare triple {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,814 INFO L290 TraceCheckUtils]: 105: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13113#true} is VALID [2022-04-28 01:30:41,814 INFO L290 TraceCheckUtils]: 106: Hoare triple {13113#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,814 INFO L290 TraceCheckUtils]: 107: Hoare triple {13113#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13113#true} is VALID [2022-04-28 01:30:41,814 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13113#true} {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} is VALID [2022-04-28 01:30:41,815 INFO L290 TraceCheckUtils]: 109: Hoare triple {13433#(and (= main_~y~0 12) (= (+ (- 1) main_~c~0) 11))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 01:30:41,815 INFO L290 TraceCheckUtils]: 110: Hoare triple {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 01:30:41,815 INFO L290 TraceCheckUtils]: 111: Hoare triple {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 01:30:41,815 INFO L272 TraceCheckUtils]: 112: Hoare triple {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13113#true} is VALID [2022-04-28 01:30:41,816 INFO L290 TraceCheckUtils]: 113: Hoare triple {13113#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13471#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:30:41,816 INFO L290 TraceCheckUtils]: 114: Hoare triple {13471#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {13475#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:30:41,816 INFO L290 TraceCheckUtils]: 115: Hoare triple {13475#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13475#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:30:41,817 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13475#(not (= |__VERIFIER_assert_#in~cond| 0))} {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 01:30:41,817 INFO L290 TraceCheckUtils]: 117: Hoare triple {13458#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {13485#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-28 01:30:41,818 INFO L272 TraceCheckUtils]: 118: Hoare triple {13485#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {13489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:30:41,818 INFO L290 TraceCheckUtils]: 119: Hoare triple {13489#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {13493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:30:41,818 INFO L290 TraceCheckUtils]: 120: Hoare triple {13493#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {13114#false} is VALID [2022-04-28 01:30:41,819 INFO L290 TraceCheckUtils]: 121: Hoare triple {13114#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13114#false} is VALID [2022-04-28 01:30:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 66 proven. 365 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-28 01:30:41,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:31:00,236 WARN L833 $PredicateComparison]: unable to prove that (or (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))))) (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 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) is different from false [2022-04-28 01:31:02,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:31:02,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492599338] [2022-04-28 01:31:02,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:31:02,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508256372] [2022-04-28 01:31:02,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508256372] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:31:02,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:31:02,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-28 01:31:02,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843584971] [2022-04-28 01:31:02,307 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:31:02,308 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 122 [2022-04-28 01:31:02,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:31:02,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 01:31:02,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:31:02,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 01:31:02,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:31:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 01:31:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=539, Unknown=1, NotChecked=46, Total=650 [2022-04-28 01:31:02,397 INFO L87 Difference]: Start difference. First operand 173 states and 180 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 01:31:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:04,805 INFO L93 Difference]: Finished difference Result 178 states and 184 transitions. [2022-04-28 01:31:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 01:31:04,805 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 122 [2022-04-28 01:31:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:31:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 01:31:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-28 01:31:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 01:31:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-28 01:31:04,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 94 transitions. [2022-04-28 01:31:04,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:31:04,912 INFO L225 Difference]: With dead ends: 178 [2022-04-28 01:31:04,912 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 01:31:04,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=84, Invalid=675, Unknown=1, NotChecked=52, Total=812 [2022-04-28 01:31:04,913 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:31:04,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 725 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 01:31:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 01:31:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-28 01:31:05,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:31:05,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:05,016 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:05,017 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:05,020 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2022-04-28 01:31:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 179 transitions. [2022-04-28 01:31:05,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:31:05,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:31:05,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:31:05,021 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:31:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:05,023 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2022-04-28 01:31:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 179 transitions. [2022-04-28 01:31:05,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:31:05,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:31:05,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:31:05,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:31:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0546875) internal successors, (135), 128 states have internal predecessors, (135), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 179 transitions. [2022-04-28 01:31:05,027 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 179 transitions. Word has length 122 [2022-04-28 01:31:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:31:05,028 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 179 transitions. [2022-04-28 01:31:05,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 16 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 01:31:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 179 transitions. [2022-04-28 01:31:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 01:31:05,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:31:05,029 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:31:05,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 01:31:05,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:31:05,251 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:31:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:31:05,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1206963793, now seen corresponding path program 14 times [2022-04-28 01:31:05,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:31:05,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214002238] [2022-04-28 01:31:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:31:05,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:31:05,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:31:05,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278406077] [2022-04-28 01:31:05,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 01:31:05,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:31:05,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:31:05,274 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:31:05,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 01:31:06,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 01:31:06,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:31:06,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-28 01:31:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:31:06,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:31:06,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {14385#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {14385#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {14385#true} is VALID [2022-04-28 01:31:06,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {14385#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14385#true} {14385#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {14385#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {14385#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {14405#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:06,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {14405#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14405#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:06,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {14405#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14405#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:06,874 INFO L272 TraceCheckUtils]: 8: Hoare triple {14405#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,875 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14385#true} {14405#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14405#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:06,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {14405#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:31:06,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:31:06,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:31:06,880 INFO L272 TraceCheckUtils]: 16: Hoare triple {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,881 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14385#true} {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:31:06,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {14430#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 01:31:06,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 01:31:06,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 01:31:06,883 INFO L272 TraceCheckUtils]: 24: Hoare triple {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,884 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {14385#true} {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 01:31:06,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {14455#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:31:06,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:31:06,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:31:06,885 INFO L272 TraceCheckUtils]: 32: Hoare triple {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,886 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14385#true} {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:31:06,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {14480#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:06,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:06,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:06,888 INFO L272 TraceCheckUtils]: 40: Hoare triple {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,889 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14385#true} {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:06,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {14505#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 01:31:06,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 01:31:06,890 INFO L290 TraceCheckUtils]: 47: Hoare triple {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 01:31:06,890 INFO L272 TraceCheckUtils]: 48: Hoare triple {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,891 INFO L290 TraceCheckUtils]: 50: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,891 INFO L290 TraceCheckUtils]: 51: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,891 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14385#true} {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-28 01:31:06,892 INFO L290 TraceCheckUtils]: 53: Hoare triple {14530#(and (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14555#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:31:06,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {14555#(and (= main_~y~0 6) (= main_~c~0 6))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14555#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:31:06,893 INFO L290 TraceCheckUtils]: 55: Hoare triple {14555#(and (= main_~y~0 6) (= main_~c~0 6))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14555#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:31:06,893 INFO L272 TraceCheckUtils]: 56: Hoare triple {14555#(and (= main_~y~0 6) (= main_~c~0 6))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,893 INFO L290 TraceCheckUtils]: 57: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,893 INFO L290 TraceCheckUtils]: 58: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,894 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14385#true} {14555#(and (= main_~y~0 6) (= main_~c~0 6))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14555#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:31:06,894 INFO L290 TraceCheckUtils]: 61: Hoare triple {14555#(and (= main_~y~0 6) (= main_~c~0 6))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:06,895 INFO L290 TraceCheckUtils]: 62: Hoare triple {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:06,895 INFO L290 TraceCheckUtils]: 63: Hoare triple {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:06,895 INFO L272 TraceCheckUtils]: 64: Hoare triple {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,895 INFO L290 TraceCheckUtils]: 65: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,895 INFO L290 TraceCheckUtils]: 66: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,895 INFO L290 TraceCheckUtils]: 67: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,896 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14385#true} {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:06,896 INFO L290 TraceCheckUtils]: 69: Hoare triple {14580#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 01:31:06,896 INFO L290 TraceCheckUtils]: 70: Hoare triple {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 01:31:06,897 INFO L290 TraceCheckUtils]: 71: Hoare triple {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 01:31:06,897 INFO L272 TraceCheckUtils]: 72: Hoare triple {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,897 INFO L290 TraceCheckUtils]: 73: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,897 INFO L290 TraceCheckUtils]: 74: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,897 INFO L290 TraceCheckUtils]: 75: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,898 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14385#true} {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 01:31:06,898 INFO L290 TraceCheckUtils]: 77: Hoare triple {14605#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14630#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:31:06,898 INFO L290 TraceCheckUtils]: 78: Hoare triple {14630#(and (= main_~y~0 9) (= main_~c~0 9))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14630#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:31:06,899 INFO L290 TraceCheckUtils]: 79: Hoare triple {14630#(and (= main_~y~0 9) (= main_~c~0 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14630#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:31:06,899 INFO L272 TraceCheckUtils]: 80: Hoare triple {14630#(and (= main_~y~0 9) (= main_~c~0 9))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,899 INFO L290 TraceCheckUtils]: 81: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,899 INFO L290 TraceCheckUtils]: 82: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,899 INFO L290 TraceCheckUtils]: 83: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,899 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {14385#true} {14630#(and (= main_~y~0 9) (= main_~c~0 9))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14630#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-28 01:31:06,900 INFO L290 TraceCheckUtils]: 85: Hoare triple {14630#(and (= main_~y~0 9) (= main_~c~0 9))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 01:31:06,900 INFO L290 TraceCheckUtils]: 86: Hoare triple {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 01:31:06,901 INFO L290 TraceCheckUtils]: 87: Hoare triple {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 01:31:06,901 INFO L272 TraceCheckUtils]: 88: Hoare triple {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,901 INFO L290 TraceCheckUtils]: 89: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,901 INFO L290 TraceCheckUtils]: 90: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,901 INFO L290 TraceCheckUtils]: 91: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,902 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14385#true} {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-28 01:31:06,902 INFO L290 TraceCheckUtils]: 93: Hoare triple {14655#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 01:31:06,903 INFO L290 TraceCheckUtils]: 94: Hoare triple {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 01:31:06,903 INFO L290 TraceCheckUtils]: 95: Hoare triple {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 01:31:06,904 INFO L272 TraceCheckUtils]: 96: Hoare triple {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,904 INFO L290 TraceCheckUtils]: 97: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,904 INFO L290 TraceCheckUtils]: 98: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,904 INFO L290 TraceCheckUtils]: 99: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,904 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {14385#true} {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-28 01:31:06,905 INFO L290 TraceCheckUtils]: 101: Hoare triple {14680#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-28 01:31:06,905 INFO L290 TraceCheckUtils]: 102: Hoare triple {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-28 01:31:06,906 INFO L290 TraceCheckUtils]: 103: Hoare triple {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-28 01:31:06,906 INFO L272 TraceCheckUtils]: 104: Hoare triple {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,906 INFO L290 TraceCheckUtils]: 105: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,906 INFO L290 TraceCheckUtils]: 106: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,906 INFO L290 TraceCheckUtils]: 107: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,907 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {14385#true} {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} is VALID [2022-04-28 01:31:06,907 INFO L290 TraceCheckUtils]: 109: Hoare triple {14705#(and (= (+ (- 2) main_~y~0) 10) (= main_~c~0 12))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14730#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 01:31:06,908 INFO L290 TraceCheckUtils]: 110: Hoare triple {14730#(and (= main_~c~0 13) (= main_~y~0 13))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14730#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 01:31:06,908 INFO L290 TraceCheckUtils]: 111: Hoare triple {14730#(and (= main_~c~0 13) (= main_~y~0 13))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14730#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 01:31:06,908 INFO L272 TraceCheckUtils]: 112: Hoare triple {14730#(and (= main_~c~0 13) (= main_~y~0 13))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,908 INFO L290 TraceCheckUtils]: 113: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,908 INFO L290 TraceCheckUtils]: 114: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,908 INFO L290 TraceCheckUtils]: 115: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,909 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {14385#true} {14730#(and (= main_~c~0 13) (= main_~y~0 13))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14730#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-28 01:31:06,909 INFO L290 TraceCheckUtils]: 117: Hoare triple {14730#(and (= main_~c~0 13) (= main_~y~0 13))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 01:31:06,910 INFO L290 TraceCheckUtils]: 118: Hoare triple {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 01:31:06,910 INFO L290 TraceCheckUtils]: 119: Hoare triple {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 01:31:06,910 INFO L272 TraceCheckUtils]: 120: Hoare triple {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14385#true} is VALID [2022-04-28 01:31:06,910 INFO L290 TraceCheckUtils]: 121: Hoare triple {14385#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14385#true} is VALID [2022-04-28 01:31:06,911 INFO L290 TraceCheckUtils]: 122: Hoare triple {14385#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,911 INFO L290 TraceCheckUtils]: 123: Hoare triple {14385#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14385#true} is VALID [2022-04-28 01:31:06,911 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14385#true} {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 01:31:06,912 INFO L290 TraceCheckUtils]: 125: Hoare triple {14755#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {14780#(and (< 13 main_~k~0) (<= main_~k~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-28 01:31:06,913 INFO L272 TraceCheckUtils]: 126: Hoare triple {14780#(and (< 13 main_~k~0) (<= main_~k~0 14) (= (+ (- 1) main_~y~0) 13))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {14784#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:31:06,913 INFO L290 TraceCheckUtils]: 127: Hoare triple {14784#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14788#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:31:06,914 INFO L290 TraceCheckUtils]: 128: Hoare triple {14788#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {14386#false} is VALID [2022-04-28 01:31:06,914 INFO L290 TraceCheckUtils]: 129: Hoare triple {14386#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14386#false} is VALID [2022-04-28 01:31:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 30 proven. 420 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-28 01:31:06,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:31:07,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:31:07,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214002238] [2022-04-28 01:31:07,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:31:07,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278406077] [2022-04-28 01:31:07,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278406077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:31:07,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:31:07,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-28 01:31:07,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293421937] [2022-04-28 01:31:07,268 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:31:07,269 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 130 [2022-04-28 01:31:07,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:31:07,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 01:31:07,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:31:07,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 01:31:07,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:31:07,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 01:31:07,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-28 01:31:07,348 INFO L87 Difference]: Start difference. First operand 173 states and 179 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 01:31:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:09,506 INFO L93 Difference]: Finished difference Result 178 states and 183 transitions. [2022-04-28 01:31:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 01:31:09,506 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 130 [2022-04-28 01:31:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:31:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 01:31:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-04-28 01:31:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 01:31:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-04-28 01:31:09,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 99 transitions. [2022-04-28 01:31:09,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:31:09,616 INFO L225 Difference]: With dead ends: 178 [2022-04-28 01:31:09,617 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 01:31:09,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-28 01:31:09,618 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 01:31:09,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 828 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 01:31:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 01:31:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-28 01:31:09,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:31:09,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:09,733 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:09,733 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:09,736 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2022-04-28 01:31:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 178 transitions. [2022-04-28 01:31:09,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:31:09,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:31:09,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:31:09,737 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:31:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:09,739 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2022-04-28 01:31:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 178 transitions. [2022-04-28 01:31:09,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:31:09,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:31:09,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:31:09,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:31:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 178 transitions. [2022-04-28 01:31:09,743 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 178 transitions. Word has length 130 [2022-04-28 01:31:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:31:09,743 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 178 transitions. [2022-04-28 01:31:09,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 17 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 01:31:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 178 transitions. [2022-04-28 01:31:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 01:31:09,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:31:09,744 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:31:09,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 01:31:09,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 01:31:09,950 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:31:09,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:31:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1030291600, now seen corresponding path program 15 times [2022-04-28 01:31:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:31:09,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413807298] [2022-04-28 01:31:09,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:31:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:31:09,968 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:31:09,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261791826] [2022-04-28 01:31:09,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-28 01:31:09,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:31:09,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:31:09,969 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:31:09,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 01:31:10,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-04-28 01:31:10,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:31:10,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 01:31:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:31:10,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:31:11,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {15676#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {15676#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {15676#true} is VALID [2022-04-28 01:31:11,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {15676#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15676#true} {15676#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {15676#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {15676#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {15696#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:11,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {15696#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15696#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:11,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {15696#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15696#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:11,391 INFO L272 TraceCheckUtils]: 8: Hoare triple {15696#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,392 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15676#true} {15696#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15696#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:11,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {15696#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:31:11,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:31:11,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:31:11,393 INFO L272 TraceCheckUtils]: 16: Hoare triple {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,394 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {15676#true} {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 01:31:11,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {15721#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15746#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 01:31:11,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {15746#(and (= main_~y~0 2) (= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15746#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 01:31:11,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {15746#(and (= main_~y~0 2) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15746#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 01:31:11,395 INFO L272 TraceCheckUtils]: 24: Hoare triple {15746#(and (= main_~y~0 2) (= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,395 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15676#true} {15746#(and (= main_~y~0 2) (= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15746#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 01:31:11,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {15746#(and (= main_~y~0 2) (= main_~c~0 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15771#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:31:11,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {15771#(and (= main_~y~0 3) (= main_~c~0 3))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15771#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:31:11,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {15771#(and (= main_~y~0 3) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15771#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:31:11,397 INFO L272 TraceCheckUtils]: 32: Hoare triple {15771#(and (= main_~y~0 3) (= main_~c~0 3))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,397 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {15676#true} {15771#(and (= main_~y~0 3) (= main_~c~0 3))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15771#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-28 01:31:11,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {15771#(and (= main_~y~0 3) (= main_~c~0 3))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 01:31:11,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 01:31:11,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 01:31:11,399 INFO L272 TraceCheckUtils]: 40: Hoare triple {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,399 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {15676#true} {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 01:31:11,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {15796#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 01:31:11,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 01:31:11,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 01:31:11,400 INFO L272 TraceCheckUtils]: 48: Hoare triple {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,401 INFO L290 TraceCheckUtils]: 49: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,401 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15676#true} {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} is VALID [2022-04-28 01:31:11,402 INFO L290 TraceCheckUtils]: 53: Hoare triple {15821#(and (= 3 (+ (- 2) main_~c~0)) (= 5 main_~y~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:11,402 INFO L290 TraceCheckUtils]: 54: Hoare triple {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:11,402 INFO L290 TraceCheckUtils]: 55: Hoare triple {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:11,402 INFO L272 TraceCheckUtils]: 56: Hoare triple {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,402 INFO L290 TraceCheckUtils]: 57: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,403 INFO L290 TraceCheckUtils]: 59: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,403 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15676#true} {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 01:31:11,403 INFO L290 TraceCheckUtils]: 61: Hoare triple {15846#(and (= (+ main_~c~0 (- 3)) 3) (= 5 (+ (- 1) main_~y~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-28 01:31:11,404 INFO L290 TraceCheckUtils]: 62: Hoare triple {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-28 01:31:11,404 INFO L290 TraceCheckUtils]: 63: Hoare triple {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-28 01:31:11,404 INFO L272 TraceCheckUtils]: 64: Hoare triple {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,404 INFO L290 TraceCheckUtils]: 65: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,404 INFO L290 TraceCheckUtils]: 66: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,404 INFO L290 TraceCheckUtils]: 67: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,405 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15676#true} {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} is VALID [2022-04-28 01:31:11,409 INFO L290 TraceCheckUtils]: 69: Hoare triple {15871#(and (= 3 (+ main_~c~0 (- 4))) (= 7 main_~y~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} is VALID [2022-04-28 01:31:11,409 INFO L290 TraceCheckUtils]: 70: Hoare triple {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} is VALID [2022-04-28 01:31:11,409 INFO L290 TraceCheckUtils]: 71: Hoare triple {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} is VALID [2022-04-28 01:31:11,409 INFO L272 TraceCheckUtils]: 72: Hoare triple {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,409 INFO L290 TraceCheckUtils]: 73: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,410 INFO L290 TraceCheckUtils]: 74: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,410 INFO L290 TraceCheckUtils]: 75: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,410 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {15676#true} {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} is VALID [2022-04-28 01:31:11,410 INFO L290 TraceCheckUtils]: 77: Hoare triple {15896#(and (= 3 (+ main_~c~0 (- 5))) (= main_~y~0 8))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} is VALID [2022-04-28 01:31:11,411 INFO L290 TraceCheckUtils]: 78: Hoare triple {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} is VALID [2022-04-28 01:31:11,411 INFO L290 TraceCheckUtils]: 79: Hoare triple {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} is VALID [2022-04-28 01:31:11,411 INFO L272 TraceCheckUtils]: 80: Hoare triple {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,411 INFO L290 TraceCheckUtils]: 81: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,411 INFO L290 TraceCheckUtils]: 82: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,411 INFO L290 TraceCheckUtils]: 83: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,412 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {15676#true} {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} is VALID [2022-04-28 01:31:11,412 INFO L290 TraceCheckUtils]: 85: Hoare triple {15921#(and (= main_~y~0 9) (= 3 (+ main_~c~0 (- 6))))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} is VALID [2022-04-28 01:31:11,413 INFO L290 TraceCheckUtils]: 86: Hoare triple {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} is VALID [2022-04-28 01:31:11,413 INFO L290 TraceCheckUtils]: 87: Hoare triple {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} is VALID [2022-04-28 01:31:11,413 INFO L272 TraceCheckUtils]: 88: Hoare triple {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,413 INFO L290 TraceCheckUtils]: 89: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,413 INFO L290 TraceCheckUtils]: 90: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,413 INFO L290 TraceCheckUtils]: 91: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,414 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {15676#true} {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} is VALID [2022-04-28 01:31:11,414 INFO L290 TraceCheckUtils]: 93: Hoare triple {15946#(and (= (+ main_~c~0 (- 7)) 3) (= main_~y~0 10))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15971#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:31:11,415 INFO L290 TraceCheckUtils]: 94: Hoare triple {15971#(and (= main_~c~0 11) (= main_~y~0 11))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15971#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:31:11,416 INFO L290 TraceCheckUtils]: 95: Hoare triple {15971#(and (= main_~c~0 11) (= main_~y~0 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15971#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:31:11,416 INFO L272 TraceCheckUtils]: 96: Hoare triple {15971#(and (= main_~c~0 11) (= main_~y~0 11))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,416 INFO L290 TraceCheckUtils]: 97: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,416 INFO L290 TraceCheckUtils]: 98: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,416 INFO L290 TraceCheckUtils]: 99: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,417 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {15676#true} {15971#(and (= main_~c~0 11) (= main_~y~0 11))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15971#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:31:11,417 INFO L290 TraceCheckUtils]: 101: Hoare triple {15971#(and (= main_~c~0 11) (= main_~y~0 11))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 01:31:11,417 INFO L290 TraceCheckUtils]: 102: Hoare triple {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 01:31:11,418 INFO L290 TraceCheckUtils]: 103: Hoare triple {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 01:31:11,418 INFO L272 TraceCheckUtils]: 104: Hoare triple {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,418 INFO L290 TraceCheckUtils]: 105: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,418 INFO L290 TraceCheckUtils]: 106: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,418 INFO L290 TraceCheckUtils]: 107: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,418 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15676#true} {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 01:31:11,419 INFO L290 TraceCheckUtils]: 109: Hoare triple {15996#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 01:31:11,419 INFO L290 TraceCheckUtils]: 110: Hoare triple {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 01:31:11,420 INFO L290 TraceCheckUtils]: 111: Hoare triple {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 01:31:11,420 INFO L272 TraceCheckUtils]: 112: Hoare triple {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,420 INFO L290 TraceCheckUtils]: 113: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,420 INFO L290 TraceCheckUtils]: 114: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,420 INFO L290 TraceCheckUtils]: 115: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,420 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15676#true} {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} is VALID [2022-04-28 01:31:11,421 INFO L290 TraceCheckUtils]: 117: Hoare triple {16021#(and (= (+ (- 2) main_~y~0) 11) (= main_~c~0 13))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 01:31:11,421 INFO L290 TraceCheckUtils]: 118: Hoare triple {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 01:31:11,422 INFO L290 TraceCheckUtils]: 119: Hoare triple {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 01:31:11,422 INFO L272 TraceCheckUtils]: 120: Hoare triple {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,422 INFO L290 TraceCheckUtils]: 121: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,422 INFO L290 TraceCheckUtils]: 122: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,422 INFO L290 TraceCheckUtils]: 123: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,422 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {15676#true} {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} is VALID [2022-04-28 01:31:11,423 INFO L290 TraceCheckUtils]: 125: Hoare triple {16046#(and (= (+ main_~y~0 (- 3)) 11) (= (+ (- 1) main_~c~0) 13))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 01:31:11,427 INFO L290 TraceCheckUtils]: 126: Hoare triple {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 01:31:11,431 INFO L290 TraceCheckUtils]: 127: Hoare triple {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 01:31:11,431 INFO L272 TraceCheckUtils]: 128: Hoare triple {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {15676#true} is VALID [2022-04-28 01:31:11,432 INFO L290 TraceCheckUtils]: 129: Hoare triple {15676#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {15676#true} is VALID [2022-04-28 01:31:11,432 INFO L290 TraceCheckUtils]: 130: Hoare triple {15676#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,432 INFO L290 TraceCheckUtils]: 131: Hoare triple {15676#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15676#true} is VALID [2022-04-28 01:31:11,432 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {15676#true} {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-28 01:31:11,433 INFO L290 TraceCheckUtils]: 133: Hoare triple {16071#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {16096#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-28 01:31:11,434 INFO L272 TraceCheckUtils]: 134: Hoare triple {16096#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {16100#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:31:11,434 INFO L290 TraceCheckUtils]: 135: Hoare triple {16100#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16104#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:31:11,434 INFO L290 TraceCheckUtils]: 136: Hoare triple {16104#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {15677#false} is VALID [2022-04-28 01:31:11,434 INFO L290 TraceCheckUtils]: 137: Hoare triple {15677#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15677#false} is VALID [2022-04-28 01:31:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 32 proven. 480 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 01:31:11,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:31:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:31:11,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413807298] [2022-04-28 01:31:11,754 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:31:11,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261791826] [2022-04-28 01:31:11,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261791826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:31:11,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:31:11,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-28 01:31:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94231662] [2022-04-28 01:31:11,754 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:31:11,754 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 138 [2022-04-28 01:31:11,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:31:11,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 01:31:11,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:31:11,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 01:31:11,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:31:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 01:31:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2022-04-28 01:31:11,841 INFO L87 Difference]: Start difference. First operand 173 states and 178 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 01:31:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:14,274 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2022-04-28 01:31:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 01:31:14,274 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Word has length 138 [2022-04-28 01:31:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:31:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 01:31:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 104 transitions. [2022-04-28 01:31:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 01:31:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 104 transitions. [2022-04-28 01:31:14,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 104 transitions. [2022-04-28 01:31:14,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:31:14,396 INFO L225 Difference]: With dead ends: 178 [2022-04-28 01:31:14,396 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 01:31:14,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2022-04-28 01:31:14,397 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:31:14,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 912 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 01:31:14,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 01:31:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-28 01:31:14,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:31:14,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:14,507 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:14,507 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:14,510 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2022-04-28 01:31:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2022-04-28 01:31:14,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:31:14,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:31:14,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:31:14,511 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:31:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:14,513 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2022-04-28 01:31:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2022-04-28 01:31:14,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:31:14,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:31:14,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:31:14,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:31:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.0390625) internal successors, (133), 128 states have internal predecessors, (133), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2022-04-28 01:31:14,518 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 138 [2022-04-28 01:31:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:31:14,519 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2022-04-28 01:31:14,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 18 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 01:31:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2022-04-28 01:31:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-28 01:31:14,520 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:31:14,520 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:31:14,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 01:31:14,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 01:31:14,729 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:31:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:31:14,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1153802639, now seen corresponding path program 16 times [2022-04-28 01:31:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:31:14,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788916881] [2022-04-28 01:31:14,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:31:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:31:14,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:31:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [486812229] [2022-04-28 01:31:14,748 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 01:31:14,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:31:14,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:31:14,749 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:31:14,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 01:31:15,657 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 01:31:15,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:31:15,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 01:31:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:31:15,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:31:16,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {16992#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {16992#true} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {16992#true} is VALID [2022-04-28 01:31:16,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {16992#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16992#true} {16992#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {16992#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {16992#true} [64] mainENTRY-->L27-3: Formula: (and (= v_main_~c~0_2 0) (<= |v_main_#t~nondet4_2| 32767) (<= 0 (+ |v_main_#t~nondet4_2| 32768)) (= v_main_~k~0_2 |v_main_#t~nondet4_2|) (= v_main_~x~0_2 0) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_2, 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] {17012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:16,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {17012#(and (= main_~c~0 0) (= main_~y~0 0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:16,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {17012#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:16,536 INFO L272 TraceCheckUtils]: 8: Hoare triple {17012#(and (= main_~c~0 0) (= main_~y~0 0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,537 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16992#true} {17012#(and (= main_~c~0 0) (= main_~y~0 0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 01:31:16,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {17012#(and (= main_~c~0 0) (= main_~y~0 0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:31:16,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:31:16,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:31:16,538 INFO L272 TraceCheckUtils]: 16: Hoare triple {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,539 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16992#true} {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 01:31:16,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {17037#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 01:31:16,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 01:31:16,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 01:31:16,540 INFO L272 TraceCheckUtils]: 24: Hoare triple {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,541 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16992#true} {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-28 01:31:16,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {17062#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:31:16,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:31:16,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:31:16,542 INFO L272 TraceCheckUtils]: 32: Hoare triple {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,543 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16992#true} {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 01:31:16,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {17087#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~c~0) 2))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 01:31:16,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 01:31:16,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 01:31:16,544 INFO L272 TraceCheckUtils]: 40: Hoare triple {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,545 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16992#true} {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-28 01:31:16,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {17112#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 01:31:16,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 01:31:16,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 01:31:16,546 INFO L272 TraceCheckUtils]: 48: Hoare triple {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,547 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16992#true} {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-28 01:31:16,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {17137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17162#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:31:16,548 INFO L290 TraceCheckUtils]: 54: Hoare triple {17162#(and (= main_~y~0 6) (= main_~c~0 6))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17162#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:31:16,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {17162#(and (= main_~y~0 6) (= main_~c~0 6))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17162#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:31:16,548 INFO L272 TraceCheckUtils]: 56: Hoare triple {17162#(and (= main_~y~0 6) (= main_~c~0 6))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,548 INFO L290 TraceCheckUtils]: 57: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,548 INFO L290 TraceCheckUtils]: 58: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,548 INFO L290 TraceCheckUtils]: 59: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,549 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16992#true} {17162#(and (= main_~y~0 6) (= main_~c~0 6))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17162#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-28 01:31:16,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {17162#(and (= main_~y~0 6) (= main_~c~0 6))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 01:31:16,550 INFO L290 TraceCheckUtils]: 62: Hoare triple {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 01:31:16,550 INFO L290 TraceCheckUtils]: 63: Hoare triple {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 01:31:16,550 INFO L272 TraceCheckUtils]: 64: Hoare triple {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,550 INFO L290 TraceCheckUtils]: 67: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,551 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16992#true} {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-28 01:31:16,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {17187#(and (= 7 main_~y~0) (= 7 main_~c~0))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 01:31:16,551 INFO L290 TraceCheckUtils]: 70: Hoare triple {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 01:31:16,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 01:31:16,552 INFO L272 TraceCheckUtils]: 72: Hoare triple {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,552 INFO L290 TraceCheckUtils]: 73: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,552 INFO L290 TraceCheckUtils]: 74: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,552 INFO L290 TraceCheckUtils]: 75: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,553 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16992#true} {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} is VALID [2022-04-28 01:31:16,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {17212#(and (= main_~y~0 8) (= 7 (+ (- 1) main_~c~0)))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 01:31:16,553 INFO L290 TraceCheckUtils]: 78: Hoare triple {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 01:31:16,554 INFO L290 TraceCheckUtils]: 79: Hoare triple {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 01:31:16,554 INFO L272 TraceCheckUtils]: 80: Hoare triple {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,554 INFO L290 TraceCheckUtils]: 81: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,554 INFO L290 TraceCheckUtils]: 82: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,554 INFO L290 TraceCheckUtils]: 83: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,555 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {16992#true} {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} is VALID [2022-04-28 01:31:16,555 INFO L290 TraceCheckUtils]: 85: Hoare triple {17237#(and (= 8 (+ (- 1) main_~y~0)) (= main_~c~0 9))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-28 01:31:16,555 INFO L290 TraceCheckUtils]: 86: Hoare triple {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-28 01:31:16,556 INFO L290 TraceCheckUtils]: 87: Hoare triple {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-28 01:31:16,556 INFO L272 TraceCheckUtils]: 88: Hoare triple {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,556 INFO L290 TraceCheckUtils]: 89: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,556 INFO L290 TraceCheckUtils]: 90: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,556 INFO L290 TraceCheckUtils]: 91: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,556 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16992#true} {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} is VALID [2022-04-28 01:31:16,557 INFO L290 TraceCheckUtils]: 93: Hoare triple {17262#(and (= (+ (- 1) main_~c~0) 9) (= (+ (- 2) main_~y~0) 8))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17287#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:31:16,557 INFO L290 TraceCheckUtils]: 94: Hoare triple {17287#(and (= main_~c~0 11) (= main_~y~0 11))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17287#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:31:16,558 INFO L290 TraceCheckUtils]: 95: Hoare triple {17287#(and (= main_~c~0 11) (= main_~y~0 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17287#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:31:16,558 INFO L272 TraceCheckUtils]: 96: Hoare triple {17287#(and (= main_~c~0 11) (= main_~y~0 11))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,558 INFO L290 TraceCheckUtils]: 97: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,558 INFO L290 TraceCheckUtils]: 98: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,558 INFO L290 TraceCheckUtils]: 99: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,558 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {16992#true} {17287#(and (= main_~c~0 11) (= main_~y~0 11))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17287#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-28 01:31:16,559 INFO L290 TraceCheckUtils]: 101: Hoare triple {17287#(and (= main_~c~0 11) (= main_~y~0 11))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 01:31:16,559 INFO L290 TraceCheckUtils]: 102: Hoare triple {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 01:31:16,559 INFO L290 TraceCheckUtils]: 103: Hoare triple {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 01:31:16,560 INFO L272 TraceCheckUtils]: 104: Hoare triple {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,560 INFO L290 TraceCheckUtils]: 105: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,560 INFO L290 TraceCheckUtils]: 106: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,560 INFO L290 TraceCheckUtils]: 107: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,560 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16992#true} {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-28 01:31:16,561 INFO L290 TraceCheckUtils]: 109: Hoare triple {17312#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 01:31:16,561 INFO L290 TraceCheckUtils]: 110: Hoare triple {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 01:31:16,561 INFO L290 TraceCheckUtils]: 111: Hoare triple {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 01:31:16,561 INFO L272 TraceCheckUtils]: 112: Hoare triple {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,561 INFO L290 TraceCheckUtils]: 113: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,562 INFO L290 TraceCheckUtils]: 114: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,562 INFO L290 TraceCheckUtils]: 115: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,562 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16992#true} {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-28 01:31:16,562 INFO L290 TraceCheckUtils]: 117: Hoare triple {17337#(and (= (+ (- 1) main_~c~0) 12) (= (+ (- 2) main_~y~0) 11))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} is VALID [2022-04-28 01:31:16,563 INFO L290 TraceCheckUtils]: 118: Hoare triple {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} is VALID [2022-04-28 01:31:16,563 INFO L290 TraceCheckUtils]: 119: Hoare triple {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} is VALID [2022-04-28 01:31:16,563 INFO L272 TraceCheckUtils]: 120: Hoare triple {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,563 INFO L290 TraceCheckUtils]: 121: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,563 INFO L290 TraceCheckUtils]: 122: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,564 INFO L290 TraceCheckUtils]: 123: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,567 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16992#true} {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} is VALID [2022-04-28 01:31:16,570 INFO L290 TraceCheckUtils]: 125: Hoare triple {17362#(and (= 12 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 3)) 11))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17387#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 01:31:16,570 INFO L290 TraceCheckUtils]: 126: Hoare triple {17387#(and (= main_~c~0 15) (= main_~y~0 15))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17387#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 01:31:16,571 INFO L290 TraceCheckUtils]: 127: Hoare triple {17387#(and (= main_~c~0 15) (= main_~y~0 15))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17387#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 01:31:16,571 INFO L272 TraceCheckUtils]: 128: Hoare triple {17387#(and (= main_~c~0 15) (= main_~y~0 15))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,571 INFO L290 TraceCheckUtils]: 129: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,571 INFO L290 TraceCheckUtils]: 130: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,571 INFO L290 TraceCheckUtils]: 131: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,571 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {16992#true} {17387#(and (= main_~c~0 15) (= main_~y~0 15))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17387#(and (= main_~c~0 15) (= main_~y~0 15))} is VALID [2022-04-28 01:31:16,572 INFO L290 TraceCheckUtils]: 133: Hoare triple {17387#(and (= main_~c~0 15) (= main_~y~0 15))} [78] L28-1-->L27-3: Formula: (and (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (= v_main_~x~0_5 (+ v_main_~x~0_6 (* v_main_~y~0_5 (* v_main_~y~0_5 v_main_~y~0_5)))) (< v_main_~c~0_6 v_main_~k~0_5) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_6, main_~x~0=v_main_~x~0_6, main_~k~0=v_main_~k~0_5} OutVars{main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_5, main_~x~0=v_main_~x~0_5, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 01:31:16,572 INFO L290 TraceCheckUtils]: 134: Hoare triple {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} [67] L27-3-->L27-1: Formula: (and (= v_~counter~0_1 (+ |v_main_#t~post5_5| 1)) (= |v_main_#t~post5_5| v_~counter~0_2)) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_5|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 01:31:16,573 INFO L290 TraceCheckUtils]: 135: Hoare triple {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 20) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 01:31:16,573 INFO L272 TraceCheckUtils]: 136: Hoare triple {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} [73] L28-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {16992#true} is VALID [2022-04-28 01:31:16,573 INFO L290 TraceCheckUtils]: 137: Hoare triple {16992#true} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16992#true} is VALID [2022-04-28 01:31:16,573 INFO L290 TraceCheckUtils]: 138: Hoare triple {16992#true} [76] L10-->L10-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,573 INFO L290 TraceCheckUtils]: 139: Hoare triple {16992#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16992#true} is VALID [2022-04-28 01:31:16,573 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {16992#true} {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} [85] __VERIFIER_assertEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= 0 (let ((.cse0 (* v_main_~y~0_9 v_main_~y~0_9))) (+ (* (- 1) (* (* (* v_main_~y~0_9 2) v_main_~y~0_9) v_main_~y~0_9)) (* v_main_~x~0_8 4) (* (- 1) (* v_main_~y~0_9 (* v_main_~y~0_9 .cse0))) (* (- 1) .cse0)))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) 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_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-28 01:31:16,575 INFO L290 TraceCheckUtils]: 141: Hoare triple {17412#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} [77] L28-1-->L27-4: Formula: (not (< v_main_~c~0_1 v_main_~k~0_1)) InVars {main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} OutVars{main_~c~0=v_main_~c~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[] {17437#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-28 01:31:16,575 INFO L272 TraceCheckUtils]: 142: Hoare triple {17437#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} [68] L27-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_10 v_main_~k~0_7) (* (- 1) (* v_main_~y~0_10 v_main_~y~0_10))) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~y~0] {17441#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:31:16,576 INFO L290 TraceCheckUtils]: 143: Hoare triple {17441#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L10: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {17445#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:31:16,576 INFO L290 TraceCheckUtils]: 144: Hoare triple {17445#(<= 1 __VERIFIER_assert_~cond)} [75] L10-->L11: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {16993#false} is VALID [2022-04-28 01:31:16,576 INFO L290 TraceCheckUtils]: 145: Hoare triple {16993#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16993#false} is VALID [2022-04-28 01:31:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 34 proven. 544 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 01:31:16,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:31:16,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:31:16,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788916881] [2022-04-28 01:31:16,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:31:16,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486812229] [2022-04-28 01:31:16,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486812229] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 01:31:16,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 01:31:16,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-28 01:31:16,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968257188] [2022-04-28 01:31:16,954 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-28 01:31:16,955 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 146 [2022-04-28 01:31:16,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:31:16,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 01:31:17,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:31:17,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 01:31:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:31:17,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 01:31:17,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-28 01:31:17,051 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 01:31:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:19,802 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2022-04-28 01:31:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 01:31:19,803 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 146 [2022-04-28 01:31:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:31:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 01:31:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2022-04-28 01:31:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 01:31:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2022-04-28 01:31:19,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 109 transitions. [2022-04-28 01:31:19,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:31:19,938 INFO L225 Difference]: With dead ends: 178 [2022-04-28 01:31:19,938 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 01:31:19,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-04-28 01:31:19,938 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 01:31:19,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1000 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 01:31:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 01:31:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-28 01:31:20,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:31:20,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:20,051 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:20,051 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:20,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:20,053 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2022-04-28 01:31:20,053 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2022-04-28 01:31:20,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:31:20,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:31:20,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:31:20,054 INFO L87 Difference]: Start difference. First operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 173 states. [2022-04-28 01:31:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:31:20,057 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2022-04-28 01:31:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2022-04-28 01:31:20,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:31:20,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:31:20,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:31:20,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:31:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.03125) internal successors, (132), 128 states have internal predecessors, (132), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 01:31:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 176 transitions. [2022-04-28 01:31:20,060 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 176 transitions. Word has length 146 [2022-04-28 01:31:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:31:20,061 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 176 transitions. [2022-04-28 01:31:20,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 19 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 01:31:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2022-04-28 01:31:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-28 01:31:20,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:31:20,062 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:31:20,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 01:31:20,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:31:20,269 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:31:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:31:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 75778898, now seen corresponding path program 17 times [2022-04-28 01:31:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:31:20,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673842484] [2022-04-28 01:31:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:31:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:31:20,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:31:20,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [565349431] [2022-04-28 01:31:20,293 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-28 01:31:20,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:31:20,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:31:20,294 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:31:20,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process