/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_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 02:19:39,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 02:19:39,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 02:19:39,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 02:19:39,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 02:19:39,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 02:19:39,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 02:19:39,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 02:19:39,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 02:19:39,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 02:19:39,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 02:19:39,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 02:19:39,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 02:19:39,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 02:19:39,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 02:19:39,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 02:19:39,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 02:19:39,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 02:19:39,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 02:19:39,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 02:19:39,853 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 02:19:39,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 02:19:39,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 02:19:39,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 02:19:39,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 02:19:39,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 02:19:39,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 02:19:39,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 02:19:39,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 02:19:39,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 02:19:39,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 02:19:39,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 02:19:39,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 02:19:39,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 02:19:39,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 02:19:39,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 02:19:39,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 02:19:39,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 02:19:39,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 02:19:39,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 02:19:39,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 02:19:39,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 02:19:39,868 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 02:19:39,889 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 02:19:39,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 02:19:39,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 02:19:39,890 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 02:19:39,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 02:19:39,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 02:19:39,891 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 02:19:39,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 02:19:39,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 02:19:39,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 02:19:39,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 02:19:39,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 02:19:39,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 02:19:39,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 02:19:39,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 02:19:39,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 02:19:39,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 02:19:39,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 02:19:39,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 02:19:39,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:19:39,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 02:19:39,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 02:19:39,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 02:19:39,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 02:19:39,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 02:19:39,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 02:19:39,895 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 02:19:39,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 02:19:39,896 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 02:19:39,896 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 02:19:40,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 02:19:40,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 02:19:40,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 02:19:40,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 02:19:40,114 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 02:19:40,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c [2022-04-08 02:19:40,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e6a6e8e8/145f5e67a4894fa0b4dfe31086a62587/FLAGbb46d1b2e [2022-04-08 02:19:40,463 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 02:19:40,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c [2022-04-08 02:19:40,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e6a6e8e8/145f5e67a4894fa0b4dfe31086a62587/FLAGbb46d1b2e [2022-04-08 02:19:40,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e6a6e8e8/145f5e67a4894fa0b4dfe31086a62587 [2022-04-08 02:19:40,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 02:19:40,897 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 02:19:40,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 02:19:40,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 02:19:40,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 02:19:40,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:19:40" (1/1) ... [2022-04-08 02:19:40,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bba2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:19:40, skipping insertion in model container [2022-04-08 02:19:40,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:19:40" (1/1) ... [2022-04-08 02:19:40,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 02:19:40,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 02:19:41,078 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_unwindbound100.c[458,471] [2022-04-08 02:19:41,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:19:41,113 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 02:19:41,125 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_unwindbound100.c[458,471] [2022-04-08 02:19:41,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 02:19:41,152 INFO L208 MainTranslator]: Completed translation [2022-04-08 02:19:41,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:19:41 WrapperNode [2022-04-08 02:19:41,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 02:19:41,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 02:19:41,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 02:19:41,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 02:19:41,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:19:41" (1/1) ... [2022-04-08 02:19:41,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:19:41" (1/1) ... [2022-04-08 02:19:41,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:19:41" (1/1) ... [2022-04-08 02:19:41,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:19:41" (1/1) ... [2022-04-08 02:19:41,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:19:41" (1/1) ... [2022-04-08 02:19:41,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:19:41" (1/1) ... [2022-04-08 02:19:41,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:19:41" (1/1) ... [2022-04-08 02:19:41,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 02:19:41,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 02:19:41,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 02:19:41,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 02:19:41,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:19:41" (1/1) ... [2022-04-08 02:19:41,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 02:19:41,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:19:41,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 02:19:41,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 02:19:41,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 02:19:41,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 02:19:41,223 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 02:19:41,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 02:19:41,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 02:19:41,224 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 02:19:41,224 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 02:19:41,225 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 02:19:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 02:19:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 02:19:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 02:19:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 02:19:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 02:19:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 02:19:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 02:19:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 02:19:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 02:19:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 02:19:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 02:19:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 02:19:41,273 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 02:19:41,274 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 02:19:41,405 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 02:19:41,409 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 02:19:41,409 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 02:19:41,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:19:41 BoogieIcfgContainer [2022-04-08 02:19:41,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 02:19:41,411 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 02:19:41,411 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 02:19:41,428 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 02:19:41,430 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:19:41" (1/1) ... [2022-04-08 02:19:41,431 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 02:19:41,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:19:41 BasicIcfg [2022-04-08 02:19:41,461 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 02:19:41,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 02:19:41,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 02:19:41,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 02:19:41,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:19:40" (1/4) ... [2022-04-08 02:19:41,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcd07b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:19:41, skipping insertion in model container [2022-04-08 02:19:41,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:19:41" (2/4) ... [2022-04-08 02:19:41,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcd07b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:19:41, skipping insertion in model container [2022-04-08 02:19:41,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:19:41" (3/4) ... [2022-04-08 02:19:41,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcd07b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:19:41, skipping insertion in model container [2022-04-08 02:19:41,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 02:19:41" (4/4) ... [2022-04-08 02:19:41,466 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound100.cqvasr [2022-04-08 02:19:41,468 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 02:19:41,469 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 02:19:41,497 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 02:19:41,501 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 02:19:41,501 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 02:19:41,515 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-08 02:19:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 02:19:41,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:19:41,519 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:19:41,519 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:19:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:19:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1984627219, now seen corresponding path program 1 times [2022-04-08 02:19:41,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:19:41,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184824636] [2022-04-08 02:19:41,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:19:41,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:19:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:41,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 02:19:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:41,648 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-08 02:19:41,648 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-08 02:19:41,648 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-08 02:19:41,650 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-08 02:19:41,650 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-08 02:19:41,650 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-08 02:19:41,651 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-08 02:19:41,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-08 02:19:41,651 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-08 02:19:41,651 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-08 02:19:41,652 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-08 02:19:41,652 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-08 02:19:41,652 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-08 02:19:41,652 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-08 02:19:41,653 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-08 02:19:41,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:19:41,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184824636] [2022-04-08 02:19:41,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184824636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:19:41,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:19:41,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 02:19:41,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460874745] [2022-04-08 02:19:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:19:41,658 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-08 02:19:41,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:19:41,660 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-08 02:19:41,678 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-08 02:19:41,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 02:19:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:19:41,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 02:19:41,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:19:41,696 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-08 02:19:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:41,806 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-08 02:19:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 02:19:41,806 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-08 02:19:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:19:41,808 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-08 02:19:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 02:19:41,816 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-08 02:19:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 02:19:41,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-08 02:19:41,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:19:41,871 INFO L225 Difference]: With dead ends: 41 [2022-04-08 02:19:41,871 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 02:19:41,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 02:19:41,877 INFO L913 BasicCegarLoop]: 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-08 02:19:41,879 INFO L914 BasicCegarLoop]: 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-08 02:19:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 02:19:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-08 02:19:41,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:19:41,903 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-08 02:19:41,904 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-08 02:19:41,904 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-08 02:19:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:41,911 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 02:19:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 02:19:41,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:19:41,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:19:41,912 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-08 02:19:41,912 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-08 02:19:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:41,920 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 02:19:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 02:19:41,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:19:41,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:19:41,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:19:41,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:19:41,922 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-08 02:19:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-08 02:19:41,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-08 02:19:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:19:41,926 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-08 02:19:41,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 02:19:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 02:19:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 02:19:41,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:19:41,927 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:19:41,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 02:19:41,928 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:19:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:19:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1423332195, now seen corresponding path program 1 times [2022-04-08 02:19:41,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:19:41,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095518787] [2022-04-08 02:19:41,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:19:41,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:19:41,951 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:19:41,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226025338] [2022-04-08 02:19:41,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:19:41,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:19:41,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:19:41,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:19:41,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 02:19:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:41,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 02:19:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:42,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:19:42,183 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-08 02:19:42,184 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-08 02:19:42,185 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-08 02:19:42,185 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-08 02:19:42,186 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-08 02:19:42,186 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-08 02:19:42,187 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-08 02:19:42,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(<= |main_#t~post5| 0)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 100)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {156#false} is VALID [2022-04-08 02:19:42,187 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-08 02:19:42,187 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-08 02:19:42,188 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-08 02:19:42,188 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-08 02:19:42,188 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-08 02:19:42,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 02:19:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:19:42,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095518787] [2022-04-08 02:19:42,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:19:42,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226025338] [2022-04-08 02:19:42,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226025338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:19:42,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:19:42,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 02:19:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305634278] [2022-04-08 02:19:42,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:19:42,190 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-08 02:19:42,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:19:42,191 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-08 02:19:42,199 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-08 02:19:42,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 02:19:42,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:19:42,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 02:19:42,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 02:19:42,200 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-08 02:19:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:42,255 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 02:19:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 02:19:42,255 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-08 02:19:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:19:42,255 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-08 02:19:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-08 02:19:42,257 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-08 02:19:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-08 02:19:42,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-08 02:19:42,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:19:42,288 INFO L225 Difference]: With dead ends: 28 [2022-04-08 02:19:42,288 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 02:19:42,288 INFO L912 BasicCegarLoop]: 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-08 02:19:42,290 INFO L913 BasicCegarLoop]: 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-08 02:19:42,291 INFO L914 BasicCegarLoop]: 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-08 02:19:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 02:19:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 02:19:42,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:19:42,299 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-08 02:19:42,300 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-08 02:19:42,300 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-08 02:19:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:42,302 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 02:19:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 02:19:42,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:19:42,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:19:42,304 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-08 02:19:42,304 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-08 02:19:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:42,308 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 02:19:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 02:19:42,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:19:42,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:19:42,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:19:42,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:19:42,309 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-08 02:19:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-08 02:19:42,311 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-08 02:19:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:19:42,311 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-08 02:19:42,312 INFO L479 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-08 02:19:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 02:19:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 02:19:42,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:19:42,312 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:19:42,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 02:19:42,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:19:42,530 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:19:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:19:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1424404671, now seen corresponding path program 1 times [2022-04-08 02:19:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:19:42,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558475766] [2022-04-08 02:19:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:19:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:19:42,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:19:42,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485958604] [2022-04-08 02:19:42,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:19:42,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:19:42,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:19:42,542 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:19:42,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 02:19:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:42,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 02:19:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:42,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:19:42,645 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-08 02:19:42,646 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-08 02:19:42,646 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-08 02:19:42,646 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-08 02:19:42,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {305#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#true} is VALID [2022-04-08 02:19:42,647 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-08 02:19:42,647 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-08 02:19:42,648 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| 100) 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-08 02:19:42,649 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-08 02:19:42,649 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-08 02:19:42,650 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-08 02:19:42,650 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-08 02:19:42,650 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-08 02:19:42,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 02:19:42,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:19:42,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558475766] [2022-04-08 02:19:42,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:19:42,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485958604] [2022-04-08 02:19:42,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485958604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 02:19:42,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 02:19:42,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 02:19:42,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276608203] [2022-04-08 02:19:42,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:19:42,652 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-08 02:19:42,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:19:42,652 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-08 02:19:42,661 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-08 02:19:42,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:19:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:19:42,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:19:42,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 02:19:42,663 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-08 02:19:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:42,834 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 02:19:42,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:19:42,835 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-08 02:19:42,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:19:42,835 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-08 02:19:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 02:19:42,839 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-08 02:19:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 02:19:42,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-08 02:19:42,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:19:42,877 INFO L225 Difference]: With dead ends: 30 [2022-04-08 02:19:42,877 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 02:19:42,878 INFO L912 BasicCegarLoop]: 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-08 02:19:42,880 INFO L913 BasicCegarLoop]: 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-08 02:19:42,881 INFO L914 BasicCegarLoop]: 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-08 02:19:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 02:19:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 02:19:42,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:19:42,888 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-08 02:19:42,890 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-08 02:19:42,890 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-08 02:19:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:42,895 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 02:19:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 02:19:42,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:19:42,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:19:42,895 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-08 02:19:42,896 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-08 02:19:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:42,898 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 02:19:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 02:19:42,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:19:42,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:19:42,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:19:42,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:19:42,900 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-08 02:19:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 02:19:42,901 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-08 02:19:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:19:42,902 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 02:19:42,902 INFO L479 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-08 02:19:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 02:19:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:19:42,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:19:42,905 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:19:42,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 02:19:43,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 02:19:43,121 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:19:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:19:43,122 INFO L85 PathProgramCache]: Analyzing trace with hash -381498108, now seen corresponding path program 1 times [2022-04-08 02:19:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:19:43,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442488994] [2022-04-08 02:19:43,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:19:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:19:43,139 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:19:43,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1827136044] [2022-04-08 02:19:43,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:19:43,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:19:43,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:19:43,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:19:43,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 02:19:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:43,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 02:19:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:43,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:19:43,336 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-08 02:19:43,337 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-08 02:19:43,337 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-08 02:19:43,338 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-08 02:19:43,339 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-08 02:19:43,339 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-08 02:19:43,339 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-08 02:19:43,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {505#(<= ~counter~0 1)} is VALID [2022-04-08 02:19:43,341 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-08 02:19:43,341 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-08 02:19:43,341 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-08 02:19:43,344 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-08 02:19:43,345 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-08 02:19:43,347 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-08 02:19:43,347 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-08 02:19:43,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {530#(<= |main_#t~post5| 1)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 100)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {482#false} is VALID [2022-04-08 02:19:43,348 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-08 02:19:43,348 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-08 02:19:43,348 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-08 02:19:43,348 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-08 02:19:43,349 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-08 02:19:43,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:19:43,474 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-08 02:19:43,474 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-08 02:19:43,475 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-08 02:19:43,475 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-08 02:19:43,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {558#(< |main_#t~post5| 100)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 100)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {482#false} is VALID [2022-04-08 02:19:43,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {562#(< ~counter~0 100)} [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| 100)} is VALID [2022-04-08 02:19:43,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(< ~counter~0 100)} [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 100)} is VALID [2022-04-08 02:19:43,477 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {481#true} {562#(< ~counter~0 100)} [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 100)} is VALID [2022-04-08 02:19:43,477 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-08 02:19:43,477 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-08 02:19:43,477 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-08 02:19:43,477 INFO L272 TraceCheckUtils]: 8: Hoare triple {562#(< ~counter~0 100)} [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-08 02:19:43,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {562#(< ~counter~0 100)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {562#(< ~counter~0 100)} is VALID [2022-04-08 02:19:43,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {587#(< ~counter~0 99)} [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 100)} is VALID [2022-04-08 02:19:43,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#(< ~counter~0 99)} [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 99)} is VALID [2022-04-08 02:19:43,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#(< ~counter~0 99)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#(< ~counter~0 99)} is VALID [2022-04-08 02:19:43,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#(< ~counter~0 99)} {481#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#(< ~counter~0 99)} is VALID [2022-04-08 02:19:43,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#(< ~counter~0 99)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#(< ~counter~0 99)} is VALID [2022-04-08 02:19:43,483 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 99)} is VALID [2022-04-08 02:19:43,484 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-08 02:19:43,484 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-08 02:19:43,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:19:43,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442488994] [2022-04-08 02:19:43,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:19:43,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827136044] [2022-04-08 02:19:43,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827136044] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 02:19:43,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 02:19:43,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 02:19:43,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232423621] [2022-04-08 02:19:43,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 02:19:43,485 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-08 02:19:43,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:19:43,485 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-08 02:19:43,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:19:43,508 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 02:19:43,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:19:43,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 02:19:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 02:19:43,508 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-08 02:19:43,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:43,664 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 02:19:43,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 02:19:43,664 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-08 02:19:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:19:43,665 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-08 02:19:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-08 02:19:43,667 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-08 02:19:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 70 transitions. [2022-04-08 02:19:43,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 70 transitions. [2022-04-08 02:19:43,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:19:43,717 INFO L225 Difference]: With dead ends: 60 [2022-04-08 02:19:43,717 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 02:19:43,717 INFO L912 BasicCegarLoop]: 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-08 02:19:43,718 INFO L913 BasicCegarLoop]: 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-08 02:19:43,718 INFO L914 BasicCegarLoop]: 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-08 02:19:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 02:19:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-08 02:19:43,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:19:43,730 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-08 02:19:43,730 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-08 02:19:43,731 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-08 02:19:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:43,732 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-08 02:19:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-08 02:19:43,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:19:43,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:19:43,733 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-08 02:19:43,733 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-08 02:19:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:43,735 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-08 02:19:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-08 02:19:43,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:19:43,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:19:43,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:19:43,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:19:43,736 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-08 02:19:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-08 02:19:43,738 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 20 [2022-04-08 02:19:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:19:43,738 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-08 02:19:43,738 INFO L479 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-08 02:19:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-08 02:19:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 02:19:43,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:19:43,738 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:19:43,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 02:19:43,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:19:43,954 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:19:43,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:19:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash -380425632, now seen corresponding path program 1 times [2022-04-08 02:19:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:19:43,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924307210] [2022-04-08 02:19:43,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:19:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:19:43,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:19:43,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101701486] [2022-04-08 02:19:43,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:19:43,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:19:43,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:19:43,970 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:19:43,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 02:19:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:44,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 02:19:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:44,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:19:44,122 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-08 02:19:44,122 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-08 02:19:44,122 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-08 02:19:44,122 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-08 02:19:44,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {875#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#true} is VALID [2022-04-08 02:19:44,123 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-08 02:19:44,123 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-08 02:19:44,124 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| 100) 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-08 02:19:44,124 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-08 02:19:44,124 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-08 02:19:44,124 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-08 02:19:44,125 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-08 02:19:44,125 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-08 02:19:44,126 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-08 02:19:44,126 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-08 02:19:44,127 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| 100) 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-08 02:19:44,128 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-08 02:19:44,128 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-08 02:19:44,128 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-08 02:19:44,129 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-08 02:19:44,129 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-08 02:19:44,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:19:44,275 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-08 02:19:44,276 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-08 02:19:44,276 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-08 02:19:44,277 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-08 02:19:44,281 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| 100) 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-08 02:19:44,283 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-08 02:19:44,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-08 02:19:44,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-08 02:19:44,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-08 02:19:44,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-08 02:19:44,291 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-08 02:19:44,291 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-08 02:19:44,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| 100) 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-08 02:19:44,293 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-08 02:19:44,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-08 02:19:44,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-08 02:19:44,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-08 02:19:44,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-08 02:19:44,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-08 02:19:44,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-08 02:19:44,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-08 02:19:44,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:19:44,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924307210] [2022-04-08 02:19:44,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:19:44,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101701486] [2022-04-08 02:19:44,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101701486] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 02:19:44,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:19:44,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 02:19:44,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972203816] [2022-04-08 02:19:44,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 02:19:44,297 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-08 02:19:44,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:19:44,297 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-08 02:19:44,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:19:44,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 02:19:44,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:19:44,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 02:19:44,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 02:19:44,315 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-08 02:19:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:44,391 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-08 02:19:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 02:19:44,391 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-08 02:19:44,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:19:44,391 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-08 02:19:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-08 02:19:44,392 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-08 02:19:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-08 02:19:44,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-08 02:19:44,413 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-08 02:19:44,414 INFO L225 Difference]: With dead ends: 62 [2022-04-08 02:19:44,414 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 02:19:44,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 02:19:44,415 INFO L913 BasicCegarLoop]: 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-08 02:19:44,415 INFO L914 BasicCegarLoop]: 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-08 02:19:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 02:19:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-08 02:19:44,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:19:44,427 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-08 02:19:44,428 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-08 02:19:44,428 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-08 02:19:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:44,430 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-08 02:19:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-08 02:19:44,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:19:44,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:19:44,431 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-08 02:19:44,431 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-08 02:19:44,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:19:44,434 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-04-08 02:19:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-08 02:19:44,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:19:44,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:19:44,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:19:44,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:19:44,434 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-08 02:19:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-04-08 02:19:44,435 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2022-04-08 02:19:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:19:44,435 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-04-08 02:19:44,448 INFO L479 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-08 02:19:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-04-08 02:19:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 02:19:44,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:19:44,448 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:19:44,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 02:19:44,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:19:44,649 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:19:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:19:44,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1647871298, now seen corresponding path program 1 times [2022-04-08 02:19:44,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:19:44,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662086320] [2022-04-08 02:19:44,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:19:44,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:19:44,681 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:19:44,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196740266] [2022-04-08 02:19:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:19:44,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:19:44,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:19:44,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:19:44,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 02:19:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:44,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 02:19:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:19:44,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:19:45,054 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-08 02:19:45,061 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-08 02:19:45,063 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-08 02:19:45,064 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-08 02:19:45,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {1257#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1257#true} is VALID [2022-04-08 02:19:45,065 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-08 02:19:45,065 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-08 02:19:45,066 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| 100) 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-08 02:19:45,066 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-08 02:19:45,066 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-08 02:19:45,066 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-08 02:19:45,066 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-08 02:19:45,066 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-08 02:19:45,067 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-08 02:19:45,068 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-08 02:19:45,068 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| 100) 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-08 02:19:45,069 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-08 02:19:45,069 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-08 02:19:45,069 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-08 02:19:45,070 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-08 02:19:45,070 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-08 02:19:45,071 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-08 02:19:45,071 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-08 02:19:45,072 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-08 02:19:45,072 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-08 02:19:45,072 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-08 02:19:45,073 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-08 02:19:45,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:20:03,592 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-08 02:20:05,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:20:05,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662086320] [2022-04-08 02:20:05,709 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:20:05,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196740266] [2022-04-08 02:20:05,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196740266] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:20:05,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:20:05,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 02:20:05,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194598516] [2022-04-08 02:20:05,709 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:20:05,710 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-08 02:20:05,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:20:05,710 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-08 02:20:05,728 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-08 02:20:05,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 02:20:05,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:20:05,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 02:20:05,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=140, Unknown=1, NotChecked=24, Total=210 [2022-04-08 02:20:05,729 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-08 02:20:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:05,988 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-08 02:20:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 02:20:05,988 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-08 02:20:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:20:05,988 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-08 02:20:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-08 02:20:05,990 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-08 02:20:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-08 02:20:05,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-08 02:20:06,013 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-08 02:20:06,014 INFO L225 Difference]: With dead ends: 50 [2022-04-08 02:20:06,014 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 02:20:06,014 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=66, Invalid=209, Unknown=1, NotChecked=30, Total=306 [2022-04-08 02:20:06,015 INFO L913 BasicCegarLoop]: 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-08 02:20:06,015 INFO L914 BasicCegarLoop]: 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-08 02:20:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 02:20:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 02:20:06,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:20:06,033 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-08 02:20:06,033 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-08 02:20:06,034 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-08 02:20:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:06,035 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-08 02:20:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-08 02:20:06,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:06,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:06,036 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-08 02:20:06,036 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-08 02:20:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:06,038 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-08 02:20:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-08 02:20:06,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:06,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:06,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:20:06,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:20:06,040 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-08 02:20:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-08 02:20:06,041 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2022-04-08 02:20:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:20:06,041 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-08 02:20:06,042 INFO L479 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-08 02:20:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-08 02:20:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 02:20:06,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:20:06,042 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:20:06,067 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-08 02:20:06,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:06,243 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:20:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:20:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash 31133987, now seen corresponding path program 2 times [2022-04-08 02:20:06,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:20:06,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632139224] [2022-04-08 02:20:06,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:20:06,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:20:06,253 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:20:06,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142533485] [2022-04-08 02:20:06,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 02:20:06,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:06,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:20:06,257 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:20:06,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 02:20:06,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 02:20:06,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:20:06,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 02:20:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:20:06,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:20:06,552 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-08 02:20:06,552 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-08 02:20:06,552 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-08 02:20:06,553 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-08 02:20:06,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {1622#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1622#true} is VALID [2022-04-08 02:20:06,553 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-08 02:20:06,554 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-08 02:20:06,554 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| 100) 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-08 02:20:06,554 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-08 02:20:06,554 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-08 02:20:06,554 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-08 02:20:06,554 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-08 02:20:06,555 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-08 02:20:06,556 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-08 02:20:06,556 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-08 02:20:06,556 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| 100) 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-08 02:20:06,557 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-08 02:20:06,557 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-08 02:20:06,557 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-08 02:20:06,557 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-08 02:20:06,557 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-08 02:20:06,558 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-08 02:20:06,558 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-08 02:20:06,559 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| 100) 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-08 02:20:06,559 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-08 02:20:06,559 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-08 02:20:06,559 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-08 02:20:06,559 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-08 02:20:06,560 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-08 02:20:06,560 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-08 02:20:06,561 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-08 02:20:06,561 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-08 02:20:06,562 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-08 02:20:06,562 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-08 02:20:06,562 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-08 02:20:06,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:20:06,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:20:06,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632139224] [2022-04-08 02:20:06,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:20:06,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142533485] [2022-04-08 02:20:06,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142533485] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:20:06,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:20:06,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 02:20:06,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147480993] [2022-04-08 02:20:06,839 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:20:06,840 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-08 02:20:06,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:20:06,840 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-08 02:20:06,859 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-08 02:20:06,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 02:20:06,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:20:06,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 02:20:06,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 02:20:06,860 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-08 02:20:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:07,092 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-08 02:20:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 02:20:07,092 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-08 02:20:07,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:20:07,093 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-08 02:20:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 02:20:07,094 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-08 02:20:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 02:20:07,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-08 02:20:07,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:20:07,118 INFO L225 Difference]: With dead ends: 50 [2022-04-08 02:20:07,118 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 02:20:07,118 INFO L912 BasicCegarLoop]: 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-08 02:20:07,119 INFO L913 BasicCegarLoop]: 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-08 02:20:07,119 INFO L914 BasicCegarLoop]: 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-08 02:20:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 02:20:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 02:20:07,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:20:07,137 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-08 02:20:07,137 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-08 02:20:07,137 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-08 02:20:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:07,138 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-08 02:20:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 02:20:07,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:07,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:07,139 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-08 02:20:07,139 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-08 02:20:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:07,140 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-08 02:20:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 02:20:07,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:07,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:07,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:20:07,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:20:07,140 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-08 02:20:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-08 02:20:07,155 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2022-04-08 02:20:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:20:07,157 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-08 02:20:07,158 INFO L479 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-08 02:20:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 02:20:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 02:20:07,159 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:20:07,159 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:20:07,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 02:20:07,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:07,372 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:20:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:20:07,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1474833412, now seen corresponding path program 3 times [2022-04-08 02:20:07,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:20:07,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274195889] [2022-04-08 02:20:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:20:07,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:20:07,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:20:07,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291868798] [2022-04-08 02:20:07,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-08 02:20:07,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:07,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:20:07,393 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:20:07,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 02:20:07,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-08 02:20:07,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:20:07,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 02:20:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:20:07,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:20:07,749 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-08 02:20:07,749 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-08 02:20:07,749 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-08 02:20:07,750 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-08 02:20:07,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {2005#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2005#true} is VALID [2022-04-08 02:20:07,751 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-08 02:20:07,751 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-08 02:20:07,752 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| 100) 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-08 02:20:07,752 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-08 02:20:07,752 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-08 02:20:07,752 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-08 02:20:07,752 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-08 02:20:07,753 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-08 02:20:07,753 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-08 02:20:07,753 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-08 02:20:07,754 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| 100) 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-08 02:20:07,754 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-08 02:20:07,754 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-08 02:20:07,754 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-08 02:20:07,754 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-08 02:20:07,755 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-08 02:20:07,758 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-08 02:20:07,758 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-08 02:20:07,759 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| 100) 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-08 02:20:07,759 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-08 02:20:07,759 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-08 02:20:07,759 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-08 02:20:07,759 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-08 02:20:07,760 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-08 02:20:07,760 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-08 02:20:07,760 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-08 02:20:07,761 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| 100) 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-08 02:20:07,761 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-08 02:20:07,761 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-08 02:20:07,761 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-08 02:20:07,761 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-08 02:20:07,762 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-08 02:20:07,762 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-08 02:20:07,763 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-08 02:20:07,763 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-08 02:20:07,763 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-08 02:20:07,764 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-08 02:20:07,764 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-08 02:20:07,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:20:07,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:20:07,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274195889] [2022-04-08 02:20:07,978 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:20:07,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291868798] [2022-04-08 02:20:07,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291868798] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:20:07,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:20:07,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 02:20:07,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740221493] [2022-04-08 02:20:07,979 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:20:07,979 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-08 02:20:07,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:20:07,980 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-08 02:20:08,000 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-08 02:20:08,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 02:20:08,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:20:08,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 02:20:08,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 02:20:08,001 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-08 02:20:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:08,308 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 02:20:08,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 02:20:08,308 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-08 02:20:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:20:08,308 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-08 02:20:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 02:20:08,311 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-08 02:20:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 02:20:08,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-08 02:20:08,346 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-08 02:20:08,347 INFO L225 Difference]: With dead ends: 52 [2022-04-08 02:20:08,347 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 02:20:08,347 INFO L912 BasicCegarLoop]: 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-08 02:20:08,348 INFO L913 BasicCegarLoop]: 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-08 02:20:08,348 INFO L914 BasicCegarLoop]: 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-08 02:20:08,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 02:20:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 02:20:08,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:20:08,372 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-08 02:20:08,374 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-08 02:20:08,374 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-08 02:20:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:08,376 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-08 02:20:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 02:20:08,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:08,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:08,376 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-08 02:20:08,377 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-08 02:20:08,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:08,379 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-08 02:20:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 02:20:08,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:08,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:08,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:20:08,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:20:08,383 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-08 02:20:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-08 02:20:08,390 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-08 02:20:08,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:20:08,390 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-08 02:20:08,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (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-08 02:20:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 02:20:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 02:20:08,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:20:08,393 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:20:08,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 02:20:08,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:08,636 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:20:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:20:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash 831591399, now seen corresponding path program 2 times [2022-04-08 02:20:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:20:08,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574393064] [2022-04-08 02:20:08,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:20:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:20:08,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:20:08,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1280571887] [2022-04-08 02:20:08,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 02:20:08,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:20:08,651 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:20:08,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 02:20:08,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 02:20:08,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:20:08,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 02:20:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:20:08,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:20:09,021 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-08 02:20:09,022 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-08 02:20:09,022 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-08 02:20:09,022 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-08 02:20:09,022 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-08 02:20:09,023 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-08 02:20:09,023 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-08 02:20:09,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {2447#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2447#(<= ~counter~0 1)} is VALID [2022-04-08 02:20:09,024 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-08 02:20:09,024 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-08 02:20:09,025 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-08 02:20:09,027 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-08 02:20:09,027 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-08 02:20:09,027 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-08 02:20:09,028 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-08 02:20:09,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(<= ~counter~0 2)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2472#(<= ~counter~0 2)} is VALID [2022-04-08 02:20:09,029 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-08 02:20:09,029 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-08 02:20:09,029 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-08 02:20:09,030 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-08 02:20:09,030 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-08 02:20:09,031 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-08 02:20:09,031 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-08 02:20:09,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {2497#(<= ~counter~0 3)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2497#(<= ~counter~0 3)} is VALID [2022-04-08 02:20:09,032 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-08 02:20:09,032 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-08 02:20:09,033 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-08 02:20:09,036 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-08 02:20:09,038 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-08 02:20:09,039 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-08 02:20:09,040 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-08 02:20:09,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {2522#(<= ~counter~0 4)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2522#(<= ~counter~0 4)} is VALID [2022-04-08 02:20:09,041 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-08 02:20:09,042 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-08 02:20:09,042 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-08 02:20:09,045 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-08 02:20:09,045 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-08 02:20:09,046 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-08 02:20:09,046 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-08 02:20:09,046 INFO L290 TraceCheckUtils]: 39: Hoare triple {2547#(<= |main_#t~post5| 4)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 100)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2424#false} is VALID [2022-04-08 02:20:09,047 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-08 02:20:09,047 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-08 02:20:09,047 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-08 02:20:09,047 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-08 02:20:09,047 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-08 02:20:09,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:20:09,310 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-08 02:20:09,310 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-08 02:20:09,310 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-08 02:20:09,310 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-08 02:20:09,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {2575#(< |main_#t~post5| 100)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 100)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2424#false} is VALID [2022-04-08 02:20:09,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {2579#(< ~counter~0 100)} [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| 100)} is VALID [2022-04-08 02:20:09,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {2579#(< ~counter~0 100)} [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 100)} is VALID [2022-04-08 02:20:09,312 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2423#true} {2579#(< ~counter~0 100)} [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 100)} is VALID [2022-04-08 02:20:09,312 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-08 02:20:09,312 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-08 02:20:09,312 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-08 02:20:09,312 INFO L272 TraceCheckUtils]: 32: Hoare triple {2579#(< ~counter~0 100)} [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-08 02:20:09,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {2579#(< ~counter~0 100)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2579#(< ~counter~0 100)} is VALID [2022-04-08 02:20:09,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {2604#(< ~counter~0 99)} [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 100)} is VALID [2022-04-08 02:20:09,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {2604#(< ~counter~0 99)} [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 99)} is VALID [2022-04-08 02:20:09,313 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2423#true} {2604#(< ~counter~0 99)} [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 99)} is VALID [2022-04-08 02:20:09,314 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-08 02:20:09,314 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-08 02:20:09,314 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-08 02:20:09,314 INFO L272 TraceCheckUtils]: 24: Hoare triple {2604#(< ~counter~0 99)} [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-08 02:20:09,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {2604#(< ~counter~0 99)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2604#(< ~counter~0 99)} is VALID [2022-04-08 02:20:09,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {2629#(< ~counter~0 98)} [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 99)} is VALID [2022-04-08 02:20:09,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {2629#(< ~counter~0 98)} [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 98)} is VALID [2022-04-08 02:20:09,315 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2423#true} {2629#(< ~counter~0 98)} [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 98)} is VALID [2022-04-08 02:20:09,315 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-08 02:20:09,315 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-08 02:20:09,316 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-08 02:20:09,316 INFO L272 TraceCheckUtils]: 16: Hoare triple {2629#(< ~counter~0 98)} [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-08 02:20:09,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {2629#(< ~counter~0 98)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2629#(< ~counter~0 98)} is VALID [2022-04-08 02:20:09,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {2654#(< ~counter~0 97)} [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 98)} is VALID [2022-04-08 02:20:09,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {2654#(< ~counter~0 97)} [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 97)} is VALID [2022-04-08 02:20:09,318 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2423#true} {2654#(< ~counter~0 97)} [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 97)} is VALID [2022-04-08 02:20:09,318 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-08 02:20:09,318 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-08 02:20:09,318 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-08 02:20:09,318 INFO L272 TraceCheckUtils]: 8: Hoare triple {2654#(< ~counter~0 97)} [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-08 02:20:09,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {2654#(< ~counter~0 97)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {2654#(< ~counter~0 97)} is VALID [2022-04-08 02:20:09,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {2679#(< ~counter~0 96)} [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 97)} is VALID [2022-04-08 02:20:09,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {2679#(< ~counter~0 96)} [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 96)} is VALID [2022-04-08 02:20:09,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {2679#(< ~counter~0 96)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2679#(< ~counter~0 96)} is VALID [2022-04-08 02:20:09,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2679#(< ~counter~0 96)} {2423#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2679#(< ~counter~0 96)} is VALID [2022-04-08 02:20:09,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {2679#(< ~counter~0 96)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2679#(< ~counter~0 96)} is VALID [2022-04-08 02:20:09,321 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 96)} is VALID [2022-04-08 02:20:09,321 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-08 02:20:09,321 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-08 02:20:09,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:20:09,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574393064] [2022-04-08 02:20:09,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:20:09,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280571887] [2022-04-08 02:20:09,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280571887] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 02:20:09,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 02:20:09,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 02:20:09,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395390150] [2022-04-08 02:20:09,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 02:20:09,322 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-08 02:20:09,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:20:09,323 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-08 02:20:09,368 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-08 02:20:09,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 02:20:09,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:20:09,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 02:20:09,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 02:20:09,369 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-08 02:20:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:09,770 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2022-04-08 02:20:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 02:20:09,770 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-08 02:20:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:20:09,770 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-08 02:20:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-08 02:20:09,780 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-08 02:20:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-08 02:20:09,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 123 transitions. [2022-04-08 02:20:09,869 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-08 02:20:09,871 INFO L225 Difference]: With dead ends: 123 [2022-04-08 02:20:09,871 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 02:20:09,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-08 02:20:09,873 INFO L913 BasicCegarLoop]: 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-08 02:20:09,873 INFO L914 BasicCegarLoop]: 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-08 02:20:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 02:20:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 93. [2022-04-08 02:20:09,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:20:09,923 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-08 02:20:09,928 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-08 02:20:09,929 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-08 02:20:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:09,932 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-08 02:20:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-08 02:20:09,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:09,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:09,935 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-08 02:20:09,935 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-08 02:20:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:09,937 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-04-08 02:20:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-04-08 02:20:09,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:09,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:09,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:20:09,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:20:09,938 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-08 02:20:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-04-08 02:20:09,940 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 44 [2022-04-08 02:20:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:20:09,940 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-04-08 02:20:09,940 INFO L479 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-08 02:20:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-04-08 02:20:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 02:20:09,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:20:09,941 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:20:09,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 02:20:10,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 02:20:10,162 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:20:10,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:20:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1805593115, now seen corresponding path program 4 times [2022-04-08 02:20:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:20:10,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944810903] [2022-04-08 02:20:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:20:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:20:10,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:20:10,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405821718] [2022-04-08 02:20:10,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 02:20:10,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:10,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:20:10,184 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:20:10,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 02:20:10,253 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 02:20:10,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:20:10,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 02:20:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:20:10,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:20:10,564 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-08 02:20:10,565 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-08 02:20:10,565 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-08 02:20:10,565 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-08 02:20:10,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {3256#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3256#true} is VALID [2022-04-08 02:20:10,565 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-08 02:20:10,566 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-08 02:20:10,566 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| 100) 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-08 02:20:10,566 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-08 02:20:10,566 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-08 02:20:10,566 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-08 02:20:10,567 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-08 02:20:10,567 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-08 02:20:10,567 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-08 02:20:10,568 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-08 02:20:10,568 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| 100) 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-08 02:20:10,568 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-08 02:20:10,568 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-08 02:20:10,568 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-08 02:20:10,568 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-08 02:20:10,569 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-08 02:20:10,569 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-08 02:20:10,569 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-08 02:20:10,570 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| 100) 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-08 02:20:10,570 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-08 02:20:10,570 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-08 02:20:10,570 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-08 02:20:10,570 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-08 02:20:10,570 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-08 02:20:10,571 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-08 02:20:10,571 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-08 02:20:10,572 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| 100) 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-08 02:20:10,572 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-08 02:20:10,572 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-08 02:20:10,572 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-08 02:20:10,572 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-08 02:20:10,573 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-08 02:20:10,573 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-08 02:20:10,573 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-08 02:20:10,574 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| 100) 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-08 02:20:10,574 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-08 02:20:10,574 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-08 02:20:10,574 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-08 02:20:10,574 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-08 02:20:10,574 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-08 02:20:10,575 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-08 02:20:10,576 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-08 02:20:10,576 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-08 02:20:10,576 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-08 02:20:10,576 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-08 02:20:10,577 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-08 02:20:10,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:20:10,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:20:10,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944810903] [2022-04-08 02:20:10,789 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:20:10,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405821718] [2022-04-08 02:20:10,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405821718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:20:10,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:20:10,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 02:20:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737146169] [2022-04-08 02:20:10,790 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:20:10,791 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-08 02:20:10,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:20:10,791 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-08 02:20:10,817 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-08 02:20:10,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 02:20:10,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:20:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 02:20:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 02:20:10,818 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-08 02:20:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:11,209 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-04-08 02:20:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 02:20:11,209 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-08 02:20:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:20:11,209 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-08 02:20:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-08 02:20:11,210 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-08 02:20:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-08 02:20:11,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-08 02:20:11,245 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-08 02:20:11,246 INFO L225 Difference]: With dead ends: 98 [2022-04-08 02:20:11,246 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 02:20:11,246 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 02:20:11,247 INFO L913 BasicCegarLoop]: 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-08 02:20:11,247 INFO L914 BasicCegarLoop]: 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-08 02:20:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 02:20:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-08 02:20:11,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:20:11,287 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-08 02:20:11,287 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-08 02:20:11,287 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-08 02:20:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:11,289 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-08 02:20:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-08 02:20:11,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:11,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:11,289 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-08 02:20:11,289 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-08 02:20:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:11,291 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-04-08 02:20:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-08 02:20:11,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:11,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:11,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:20:11,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:20:11,291 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-08 02:20:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2022-04-08 02:20:11,293 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 50 [2022-04-08 02:20:11,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:20:11,293 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2022-04-08 02:20:11,293 INFO L479 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-08 02:20:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-08 02:20:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 02:20:11,293 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:20:11,293 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:20:11,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 02:20:11,510 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 02:20:11,510 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:20:11,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:20:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1447431878, now seen corresponding path program 5 times [2022-04-08 02:20:11,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:20:11,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623873002] [2022-04-08 02:20:11,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:20:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:20:11,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:20:11,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724781272] [2022-04-08 02:20:11,525 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-08 02:20:11,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:11,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:20:11,541 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:20:11,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 02:20:11,738 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-08 02:20:11,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:20:11,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 02:20:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:20:11,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:20:12,096 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-08 02:20:12,097 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-08 02:20:12,097 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-08 02:20:12,097 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-08 02:20:12,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {3917#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3917#true} is VALID [2022-04-08 02:20:12,098 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-08 02:20:12,098 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-08 02:20:12,099 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| 100) 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-08 02:20:12,099 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-08 02:20:12,099 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-08 02:20:12,099 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-08 02:20:12,099 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-08 02:20:12,100 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-08 02:20:12,100 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-08 02:20:12,101 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-08 02:20:12,101 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| 100) 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-08 02:20:12,105 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-08 02:20:12,105 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-08 02:20:12,112 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-08 02:20:12,112 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-08 02:20:12,112 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-08 02:20:12,113 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-08 02:20:12,113 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-08 02:20:12,114 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| 100) 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-08 02:20:12,114 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-08 02:20:12,114 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-08 02:20:12,114 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-08 02:20:12,114 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-08 02:20:12,114 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-08 02:20:12,115 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-08 02:20:12,115 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-08 02:20:12,116 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| 100) 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-08 02:20:12,116 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-08 02:20:12,116 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-08 02:20:12,116 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-08 02:20:12,116 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-08 02:20:12,117 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-08 02:20:12,117 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-08 02:20:12,118 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-08 02:20:12,118 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| 100) 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-08 02:20:12,118 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-08 02:20:12,118 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-08 02:20:12,118 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-08 02:20:12,118 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-08 02:20:12,119 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-08 02:20:12,119 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-08 02:20:12,120 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-08 02:20:12,120 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| 100) 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-08 02:20:12,120 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-08 02:20:12,120 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-08 02:20:12,121 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-08 02:20:12,121 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-08 02:20:12,121 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-08 02:20:12,122 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-08 02:20:12,122 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-08 02:20:12,123 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-08 02:20:12,123 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-08 02:20:12,123 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-08 02:20:12,124 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-08 02:20:12,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:20:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:20:12,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623873002] [2022-04-08 02:20:12,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:20:12,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724781272] [2022-04-08 02:20:12,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724781272] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:20:12,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:20:12,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 02:20:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270677832] [2022-04-08 02:20:12,382 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:20:12,382 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-08 02:20:12,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:20:12,382 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-08 02:20:12,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:20:12,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 02:20:12,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:20:12,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 02:20:12,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 02:20:12,412 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-08 02:20:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:12,848 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-04-08 02:20:12,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 02:20:12,848 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-08 02:20:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:20:12,849 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-08 02:20:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 02:20:12,850 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-08 02:20:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 02:20:12,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-08 02:20:12,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:20:12,886 INFO L225 Difference]: With dead ends: 98 [2022-04-08 02:20:12,886 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 02:20:12,886 INFO L912 BasicCegarLoop]: 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-08 02:20:12,887 INFO L913 BasicCegarLoop]: 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-08 02:20:12,887 INFO L914 BasicCegarLoop]: 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-08 02:20:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 02:20:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-08 02:20:12,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:20:12,925 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-08 02:20:12,925 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-08 02:20:12,925 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-08 02:20:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:12,926 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-08 02:20:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-08 02:20:12,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:12,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:12,927 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-08 02:20:12,927 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-08 02:20:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:12,928 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-08 02:20:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-08 02:20:12,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:12,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:12,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:20:12,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:20:12,929 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-08 02:20:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-04-08 02:20:12,930 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 58 [2022-04-08 02:20:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:20:12,930 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-04-08 02:20:12,930 INFO L479 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-08 02:20:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-08 02:20:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 02:20:12,931 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:20:12,931 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:20:12,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 02:20:13,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 02:20:13,136 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:20:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:20:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1416046937, now seen corresponding path program 6 times [2022-04-08 02:20:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:20:13,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450406613] [2022-04-08 02:20:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:20:13,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:20:13,148 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:20:13,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976592337] [2022-04-08 02:20:13,149 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 02:20:13,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:13,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:20:13,160 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 02:20:13,162 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-08 02:20:13,508 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 02:20:13,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:20:13,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 02:20:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:20:13,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:20:14,153 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-08 02:20:14,154 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-08 02:20:14,154 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-08 02:20:14,154 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-08 02:20:14,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {4603#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4603#true} is VALID [2022-04-08 02:20:14,154 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-08 02:20:14,155 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-08 02:20:14,155 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| 100) 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-08 02:20:14,155 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-08 02:20:14,155 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-08 02:20:14,155 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-08 02:20:14,155 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-08 02:20:14,156 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-08 02:20:14,156 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-08 02:20:14,157 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-08 02:20:14,157 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| 100) 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-08 02:20:14,157 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-08 02:20:14,157 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-08 02:20:14,157 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-08 02:20:14,158 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-08 02:20:14,158 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-08 02:20:14,158 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) (= main_~c~0 2))} is VALID [2022-04-08 02:20:14,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {4673#(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] {4673#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:20:14,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {4673#(and (= main_~y~0 2) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4673#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:20:14,159 INFO L272 TraceCheckUtils]: 24: Hoare triple {4673#(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] {4603#true} is VALID [2022-04-08 02:20:14,159 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-08 02:20:14,160 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-08 02:20:14,160 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-08 02:20:14,160 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4603#true} {4673#(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] {4673#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:20:14,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {4673#(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] {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 02:20:14,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~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)) (= main_~c~0 3))} is VALID [2022-04-08 02:20:14,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4698#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 02:20:14,161 INFO L272 TraceCheckUtils]: 32: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~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-08 02:20:14,162 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-08 02:20:14,162 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-08 02:20:14,162 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-08 02:20:14,162 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4603#true} {4698#(and (= 2 (+ (- 1) main_~y~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)) (= main_~c~0 3))} is VALID [2022-04-08 02:20:14,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {4698#(and (= 2 (+ (- 1) main_~y~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 (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 02:20:14,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {4723#(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] {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 02:20:14,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 02:20:14,163 INFO L272 TraceCheckUtils]: 40: Hoare triple {4723#(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] {4603#true} is VALID [2022-04-08 02:20:14,164 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-08 02:20:14,164 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-08 02:20:14,164 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-08 02:20:14,164 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4603#true} {4723#(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] {4723#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 02:20:14,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {4723#(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] {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 02:20:14,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {4748#(and (= (+ 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 (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 02:20:14,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4748#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 02:20:14,165 INFO L272 TraceCheckUtils]: 48: Hoare triple {4748#(and (= (+ 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-08 02:20:14,165 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-08 02:20:14,166 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-08 02:20:14,166 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-08 02:20:14,166 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4603#true} {4748#(and (= (+ 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 (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 02:20:14,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {4748#(and (= (+ 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 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 02:20:14,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 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 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 02:20:14,167 INFO L290 TraceCheckUtils]: 55: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 02:20:14,167 INFO L272 TraceCheckUtils]: 56: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 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-08 02:20:14,167 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-08 02:20:14,168 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-08 02:20:14,168 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-08 02:20:14,168 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4603#true} {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 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 (- 4)) 2) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 02:20:14,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {4773#(and (= (+ main_~y~0 (- 4)) 2) (< 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_~k~0 6) (= (+ main_~y~0 (- 4)) 2) (< 5 main_~k~0))} is VALID [2022-04-08 02:20:14,169 INFO L272 TraceCheckUtils]: 62: Hoare triple {4798#(and (<= main_~k~0 6) (= (+ main_~y~0 (- 4)) 2) (< 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-08 02:20:14,170 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-08 02:20:14,170 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-08 02:20:14,170 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-08 02:20:14,170 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-08 02:20:14,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:20:14,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:20:14,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450406613] [2022-04-08 02:20:14,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:20:14,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976592337] [2022-04-08 02:20:14,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976592337] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:20:14,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:20:14,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 02:20:14,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875161592] [2022-04-08 02:20:14,445 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:20:14,445 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-08 02:20:14,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:20:14,446 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-08 02:20:14,478 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-08 02:20:14,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 02:20:14,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:20:14,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 02:20:14,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 02:20:14,479 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-08 02:20:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:15,049 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-04-08 02:20:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 02:20:15,049 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-08 02:20:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:20:15,049 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-08 02:20:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-08 02:20:15,050 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-08 02:20:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-08 02:20:15,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-08 02:20:15,091 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-08 02:20:15,092 INFO L225 Difference]: With dead ends: 98 [2022-04-08 02:20:15,092 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 02:20:15,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-08 02:20:15,093 INFO L913 BasicCegarLoop]: 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-08 02:20:15,093 INFO L914 BasicCegarLoop]: 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-08 02:20:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 02:20:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-08 02:20:15,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:20:15,131 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-08 02:20:15,131 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-08 02:20:15,131 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-08 02:20:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:15,132 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-08 02:20:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-08 02:20:15,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:15,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:15,133 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-08 02:20:15,133 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-08 02:20:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:15,134 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-04-08 02:20:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-08 02:20:15,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:15,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:15,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:20:15,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:20:15,135 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-08 02:20:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-08 02:20:15,136 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 66 [2022-04-08 02:20:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:20:15,136 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-08 02:20:15,136 INFO L479 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-08 02:20:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-08 02:20:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 02:20:15,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:20:15,137 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:20:15,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 02:20:15,342 WARN L460 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-08 02:20:15,342 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:20:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:20:15,343 INFO L85 PathProgramCache]: Analyzing trace with hash 291122568, now seen corresponding path program 7 times [2022-04-08 02:20:15,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:20:15,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305195298] [2022-04-08 02:20:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:20:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:20:15,355 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:20:15,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1572271458] [2022-04-08 02:20:15,355 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-08 02:20:15,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:15,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:20:15,356 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-08 02:20:15,357 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-08 02:20:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:20:15,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 02:20:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:20:15,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:20:16,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {5314#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {5314#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] {5314#true} is VALID [2022-04-08 02:20:16,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {5314#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5314#true} {5314#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {5314#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {5314#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] {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:16,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {5334#(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] {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:16,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {5334#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:16,324 INFO L272 TraceCheckUtils]: 8: Hoare triple {5334#(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] {5314#true} is VALID [2022-04-08 02:20:16,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {5314#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] {5314#true} is VALID [2022-04-08 02:20:16,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {5314#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[] {5314#true} is VALID [2022-04-08 02:20:16,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {5314#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,324 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5314#true} {5334#(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] {5334#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:16,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {5334#(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] {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 02:20:16,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {5359#(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] {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 02:20:16,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 02:20:16,326 INFO L272 TraceCheckUtils]: 16: Hoare triple {5359#(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] {5314#true} is VALID [2022-04-08 02:20:16,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {5314#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] {5314#true} is VALID [2022-04-08 02:20:16,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {5314#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[] {5314#true} is VALID [2022-04-08 02:20:16,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {5314#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,326 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5314#true} {5359#(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] {5359#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 02:20:16,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {5359#(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] {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 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] {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,328 INFO L272 TraceCheckUtils]: 24: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 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] {5314#true} is VALID [2022-04-08 02:20:16,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {5314#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] {5314#true} is VALID [2022-04-08 02:20:16,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {5314#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[] {5314#true} is VALID [2022-04-08 02:20:16,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {5314#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,328 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5314#true} {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 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] {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {5384#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1) (< 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] {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 02:20:16,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {5409#(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] {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 02:20:16,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 02:20:16,330 INFO L272 TraceCheckUtils]: 32: Hoare triple {5409#(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] {5314#true} is VALID [2022-04-08 02:20:16,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {5314#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] {5314#true} is VALID [2022-04-08 02:20:16,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {5314#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[] {5314#true} is VALID [2022-04-08 02:20:16,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {5314#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,330 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5314#true} {5409#(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] {5409#(and (= main_~y~0 3) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-08 02:20:16,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {5409#(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] {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) 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] {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,332 INFO L272 TraceCheckUtils]: 40: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) 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] {5314#true} is VALID [2022-04-08 02:20:16,332 INFO L290 TraceCheckUtils]: 41: Hoare triple {5314#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] {5314#true} is VALID [2022-04-08 02:20:16,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {5314#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[] {5314#true} is VALID [2022-04-08 02:20:16,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {5314#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,332 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5314#true} {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) 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] {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {5434#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) 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] {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~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] {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,334 INFO L272 TraceCheckUtils]: 48: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~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] {5314#true} is VALID [2022-04-08 02:20:16,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {5314#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] {5314#true} is VALID [2022-04-08 02:20:16,334 INFO L290 TraceCheckUtils]: 50: Hoare triple {5314#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[] {5314#true} is VALID [2022-04-08 02:20:16,334 INFO L290 TraceCheckUtils]: 51: Hoare triple {5314#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,335 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5314#true} {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~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] {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {5459#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~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] {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,335 INFO L290 TraceCheckUtils]: 54: Hoare triple {5484#(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] {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,336 INFO L272 TraceCheckUtils]: 56: Hoare triple {5484#(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] {5314#true} is VALID [2022-04-08 02:20:16,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {5314#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] {5314#true} is VALID [2022-04-08 02:20:16,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {5314#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[] {5314#true} is VALID [2022-04-08 02:20:16,336 INFO L290 TraceCheckUtils]: 59: Hoare triple {5314#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,337 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5314#true} {5484#(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] {5484#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:16,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {5484#(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] {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 02:20:16,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {5509#(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] {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 02:20:16,338 INFO L290 TraceCheckUtils]: 63: Hoare triple {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 02:20:16,338 INFO L272 TraceCheckUtils]: 64: Hoare triple {5509#(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] {5314#true} is VALID [2022-04-08 02:20:16,338 INFO L290 TraceCheckUtils]: 65: Hoare triple {5314#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] {5314#true} is VALID [2022-04-08 02:20:16,338 INFO L290 TraceCheckUtils]: 66: Hoare triple {5314#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[] {5314#true} is VALID [2022-04-08 02:20:16,338 INFO L290 TraceCheckUtils]: 67: Hoare triple {5314#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5314#true} is VALID [2022-04-08 02:20:16,339 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5314#true} {5509#(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] {5509#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 02:20:16,339 INFO L290 TraceCheckUtils]: 69: Hoare triple {5509#(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[] {5534#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 02:20:16,340 INFO L272 TraceCheckUtils]: 70: Hoare triple {5534#(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] {5538#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:20:16,340 INFO L290 TraceCheckUtils]: 71: Hoare triple {5538#(<= 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] {5542#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:20:16,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {5542#(<= 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[] {5315#false} is VALID [2022-04-08 02:20:16,340 INFO L290 TraceCheckUtils]: 73: Hoare triple {5315#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5315#false} is VALID [2022-04-08 02:20:16,341 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-08 02:20:16,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:20:17,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:20:17,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305195298] [2022-04-08 02:20:17,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:20:17,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572271458] [2022-04-08 02:20:17,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572271458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:20:17,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:20:17,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 02:20:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521034226] [2022-04-08 02:20:17,099 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:20:17,100 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-08 02:20:17,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:20:17,100 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-08 02:20:17,146 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-08 02:20:17,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 02:20:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:20:17,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 02:20:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-08 02:20:17,147 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-08 02:20:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:17,665 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-04-08 02:20:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 02:20:17,665 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-08 02:20:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:20:17,665 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-08 02:20:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-08 02:20:17,666 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-08 02:20:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-08 02:20:17,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-08 02:20:17,737 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-08 02:20:17,739 INFO L225 Difference]: With dead ends: 98 [2022-04-08 02:20:17,739 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 02:20:17,739 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-04-08 02:20:17,740 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 02:20:17,740 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 02:20:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 02:20:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-08 02:20:17,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:20:17,795 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-08 02:20:17,795 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-08 02:20:17,796 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-08 02:20:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:17,797 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-08 02:20:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-08 02:20:17,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:17,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:17,802 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-08 02:20:17,803 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-08 02:20:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:17,804 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2022-04-08 02:20:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-08 02:20:17,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:17,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:17,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:20:17,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:20:17,806 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-08 02:20:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2022-04-08 02:20:17,807 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 74 [2022-04-08 02:20:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:20:17,807 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2022-04-08 02:20:17,808 INFO L479 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-08 02:20:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-08 02:20:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 02:20:17,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:20:17,808 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:20:17,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 02:20:18,013 WARN L460 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-08 02:20:18,014 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:20:18,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:20:18,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1938494313, now seen corresponding path program 8 times [2022-04-08 02:20:18,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:20:18,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391112154] [2022-04-08 02:20:18,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:20:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:20:18,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:20:18,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307407135] [2022-04-08 02:20:18,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 02:20:18,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:20:18,043 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-08 02:20:18,044 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-08 02:20:18,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 02:20:18,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:20:18,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 02:20:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:20:18,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:20:19,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {6200#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {6200#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] {6200#true} is VALID [2022-04-08 02:20:19,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {6200#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6200#true} {6200#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {6200#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {6200#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] {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:19,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {6220#(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] {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:19,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {6220#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:19,123 INFO L272 TraceCheckUtils]: 8: Hoare triple {6220#(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] {6200#true} is VALID [2022-04-08 02:20:19,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {6200#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] {6200#true} is VALID [2022-04-08 02:20:19,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {6200#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[] {6200#true} is VALID [2022-04-08 02:20:19,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {6200#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,124 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6200#true} {6220#(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] {6220#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:19,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {6220#(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] {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:20:19,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {6245#(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] {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:20:19,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:20:19,125 INFO L272 TraceCheckUtils]: 16: Hoare triple {6245#(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] {6200#true} is VALID [2022-04-08 02:20:19,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {6200#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] {6200#true} is VALID [2022-04-08 02:20:19,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {6200#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[] {6200#true} is VALID [2022-04-08 02:20:19,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {6200#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,126 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6200#true} {6245#(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] {6245#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:20:19,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {6245#(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] {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 02:20:19,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {6270#(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] {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 02:20:19,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 02:20:19,127 INFO L272 TraceCheckUtils]: 24: Hoare triple {6270#(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] {6200#true} is VALID [2022-04-08 02:20:19,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {6200#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] {6200#true} is VALID [2022-04-08 02:20:19,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {6200#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[] {6200#true} is VALID [2022-04-08 02:20:19,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {6200#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,128 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6200#true} {6270#(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] {6270#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 02:20:19,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {6270#(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] {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:20:19,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {6295#(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] {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:20:19,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {6295#(and (= main_~y~0 3) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:20:19,129 INFO L272 TraceCheckUtils]: 32: Hoare triple {6295#(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] {6200#true} is VALID [2022-04-08 02:20:19,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {6200#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] {6200#true} is VALID [2022-04-08 02:20:19,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {6200#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[] {6200#true} is VALID [2022-04-08 02:20:19,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {6200#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,130 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6200#true} {6295#(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] {6295#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:20:19,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {6295#(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] {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:20:19,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {6320#(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] {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:20:19,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:20:19,131 INFO L272 TraceCheckUtils]: 40: Hoare triple {6320#(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] {6200#true} is VALID [2022-04-08 02:20:19,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {6200#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] {6200#true} is VALID [2022-04-08 02:20:19,131 INFO L290 TraceCheckUtils]: 42: Hoare triple {6200#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[] {6200#true} is VALID [2022-04-08 02:20:19,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {6200#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,131 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6200#true} {6320#(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] {6320#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:20:19,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {6320#(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] {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 02:20:19,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 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] {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 02:20:19,132 INFO L290 TraceCheckUtils]: 47: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 02:20:19,133 INFO L272 TraceCheckUtils]: 48: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 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] {6200#true} is VALID [2022-04-08 02:20:19,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {6200#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] {6200#true} is VALID [2022-04-08 02:20:19,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {6200#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[] {6200#true} is VALID [2022-04-08 02:20:19,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {6200#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,133 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6200#true} {6345#(and (= (+ (- 2) main_~y~0) 3) (= 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] {6345#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 02:20:19,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {6345#(and (= (+ (- 2) main_~y~0) 3) (= 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] {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-08 02:20:19,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 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] {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-08 02:20:19,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-08 02:20:19,134 INFO L272 TraceCheckUtils]: 56: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 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] {6200#true} is VALID [2022-04-08 02:20:19,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {6200#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] {6200#true} is VALID [2022-04-08 02:20:19,135 INFO L290 TraceCheckUtils]: 58: Hoare triple {6200#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[] {6200#true} is VALID [2022-04-08 02:20:19,135 INFO L290 TraceCheckUtils]: 59: Hoare triple {6200#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,135 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6200#true} {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 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] {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 3))} is VALID [2022-04-08 02:20:19,135 INFO L290 TraceCheckUtils]: 61: Hoare triple {6370#(and (= (+ (- 1) main_~c~0) 5) (= (+ main_~y~0 (- 3)) 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] {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-08 02:20:19,136 INFO L290 TraceCheckUtils]: 62: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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 (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-08 02:20:19,136 INFO L290 TraceCheckUtils]: 63: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-08 02:20:19,136 INFO L272 TraceCheckUtils]: 64: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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] {6200#true} is VALID [2022-04-08 02:20:19,136 INFO L290 TraceCheckUtils]: 65: Hoare triple {6200#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] {6200#true} is VALID [2022-04-08 02:20:19,136 INFO L290 TraceCheckUtils]: 66: Hoare triple {6200#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[] {6200#true} is VALID [2022-04-08 02:20:19,136 INFO L290 TraceCheckUtils]: 67: Hoare triple {6200#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,137 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6200#true} {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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 (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 3))} is VALID [2022-04-08 02:20:19,137 INFO L290 TraceCheckUtils]: 69: Hoare triple {6395#(and (= 5 (+ (- 2) main_~c~0)) (= (+ main_~y~0 (- 4)) 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 (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 02:20:19,137 INFO L290 TraceCheckUtils]: 70: Hoare triple {6420#(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] {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 02:20:19,138 INFO L290 TraceCheckUtils]: 71: Hoare triple {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 02:20:19,138 INFO L272 TraceCheckUtils]: 72: Hoare triple {6420#(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] {6200#true} is VALID [2022-04-08 02:20:19,138 INFO L290 TraceCheckUtils]: 73: Hoare triple {6200#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] {6200#true} is VALID [2022-04-08 02:20:19,138 INFO L290 TraceCheckUtils]: 74: Hoare triple {6200#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[] {6200#true} is VALID [2022-04-08 02:20:19,138 INFO L290 TraceCheckUtils]: 75: Hoare triple {6200#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6200#true} is VALID [2022-04-08 02:20:19,138 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {6200#true} {6420#(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] {6420#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 02:20:19,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {6420#(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[] {6445#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 02:20:19,139 INFO L272 TraceCheckUtils]: 78: Hoare triple {6445#(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] {6449#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:20:19,140 INFO L290 TraceCheckUtils]: 79: Hoare triple {6449#(<= 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] {6453#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:20:19,140 INFO L290 TraceCheckUtils]: 80: Hoare triple {6453#(<= 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[] {6201#false} is VALID [2022-04-08 02:20:19,146 INFO L290 TraceCheckUtils]: 81: Hoare triple {6201#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6201#false} is VALID [2022-04-08 02:20:19,146 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-08 02:20:19,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:20:19,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:20:19,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391112154] [2022-04-08 02:20:19,424 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:20:19,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307407135] [2022-04-08 02:20:19,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307407135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:20:19,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:20:19,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 02:20:19,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670508475] [2022-04-08 02:20:19,425 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:20:19,451 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-08 02:20:19,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:20:19,451 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-08 02:20:19,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:20:19,508 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 02:20:19,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:20:19,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 02:20:19,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 02:20:19,509 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-08 02:20:20,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:20,356 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-04-08 02:20:20,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 02:20:20,356 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-08 02:20:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:20:20,356 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-08 02:20:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-08 02:20:20,359 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-08 02:20:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-08 02:20:20,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-08 02:20:20,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:20:20,402 INFO L225 Difference]: With dead ends: 98 [2022-04-08 02:20:20,403 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 02:20:20,403 INFO L912 BasicCegarLoop]: 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-08 02:20:20,404 INFO L913 BasicCegarLoop]: 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-08 02:20:20,404 INFO L914 BasicCegarLoop]: 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-08 02:20:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 02:20:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-08 02:20:20,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:20:20,432 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-08 02:20:20,432 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-08 02:20:20,433 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-08 02:20:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:20,434 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-08 02:20:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-08 02:20:20,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:20,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:20,434 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-08 02:20:20,434 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-08 02:20:20,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:20:20,436 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-08 02:20:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-08 02:20:20,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:20:20,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:20:20,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:20:20,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:20:20,436 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-08 02:20:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-04-08 02:20:20,437 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 82 [2022-04-08 02:20:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:20:20,437 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-04-08 02:20:20,438 INFO L479 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-08 02:20:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-08 02:20:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-08 02:20:20,438 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:20:20,438 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:20:20,459 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-08 02:20:20,644 WARN L460 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-08 02:20:20,644 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:20:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:20:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 757893194, now seen corresponding path program 9 times [2022-04-08 02:20:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:20:20,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043283770] [2022-04-08 02:20:20,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:20:20,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:20:20,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:20:20,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1800722196] [2022-04-08 02:20:20,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-08 02:20:20,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:20:20,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:20:20,655 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-08 02:20:20,656 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-08 02:20:21,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-04-08 02:20:21,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:20:21,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-08 02:20:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:20:21,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:20:22,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {6961#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {6961#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] {6961#true} is VALID [2022-04-08 02:20:22,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {6961#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6961#true} {6961#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {6961#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {6961#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] {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:22,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {6981#(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] {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:22,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {6981#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:22,059 INFO L272 TraceCheckUtils]: 8: Hoare triple {6981#(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] {6961#true} is VALID [2022-04-08 02:20:22,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {6961#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] {6961#true} is VALID [2022-04-08 02:20:22,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {6961#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[] {6961#true} is VALID [2022-04-08 02:20:22,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {6961#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,068 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6961#true} {6981#(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] {6981#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:20:22,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {6981#(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] {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 02:20:22,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~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] {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 02:20:22,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 02:20:22,073 INFO L272 TraceCheckUtils]: 16: Hoare triple {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~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] {6961#true} is VALID [2022-04-08 02:20:22,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {6961#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] {6961#true} is VALID [2022-04-08 02:20:22,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {6961#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[] {6961#true} is VALID [2022-04-08 02:20:22,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {6961#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,073 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6961#true} {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~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] {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 02:20:22,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {7006#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~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] {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:20:22,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~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] {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:20:22,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:20:22,075 INFO L272 TraceCheckUtils]: 24: Hoare triple {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~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] {6961#true} is VALID [2022-04-08 02:20:22,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {6961#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] {6961#true} is VALID [2022-04-08 02:20:22,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {6961#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[] {6961#true} is VALID [2022-04-08 02:20:22,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {6961#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,076 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6961#true} {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~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] {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:20:22,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {7031#(and (= main_~y~0 2) (< main_~c~0 (+ main_~k~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] {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 02:20:22,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~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] {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 02:20:22,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 02:20:22,077 INFO L272 TraceCheckUtils]: 32: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~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] {6961#true} is VALID [2022-04-08 02:20:22,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {6961#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] {6961#true} is VALID [2022-04-08 02:20:22,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {6961#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[] {6961#true} is VALID [2022-04-08 02:20:22,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {6961#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,078 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6961#true} {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~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] {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 02:20:22,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {7056#(and (= 2 (+ (- 1) main_~y~0)) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~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] {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 02:20:22,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~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] {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 02:20:22,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 02:20:22,079 INFO L272 TraceCheckUtils]: 40: Hoare triple {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~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] {6961#true} is VALID [2022-04-08 02:20:22,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {6961#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] {6961#true} is VALID [2022-04-08 02:20:22,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {6961#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[] {6961#true} is VALID [2022-04-08 02:20:22,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {6961#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,080 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6961#true} {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~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] {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~0 4)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 02:20:22,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {7081#(and (= main_~y~0 4) (< main_~c~0 (+ main_~k~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] {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 02:20:22,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~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] {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 02:20:22,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 02:20:22,081 INFO L272 TraceCheckUtils]: 48: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~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] {6961#true} is VALID [2022-04-08 02:20:22,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {6961#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] {6961#true} is VALID [2022-04-08 02:20:22,082 INFO L290 TraceCheckUtils]: 50: Hoare triple {6961#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[] {6961#true} is VALID [2022-04-08 02:20:22,082 INFO L290 TraceCheckUtils]: 51: Hoare triple {6961#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,082 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6961#true} {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~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] {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 02:20:22,082 INFO L290 TraceCheckUtils]: 53: Hoare triple {7106#(and (= (+ main_~c~0 (- 5)) 0) (< main_~c~0 (+ 5 main_~k~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] {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-08 02:20:22,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 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] {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-08 02:20:22,086 INFO L290 TraceCheckUtils]: 55: Hoare triple {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-08 02:20:22,086 INFO L272 TraceCheckUtils]: 56: Hoare triple {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 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] {6961#true} is VALID [2022-04-08 02:20:22,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {6961#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] {6961#true} is VALID [2022-04-08 02:20:22,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {6961#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[] {6961#true} is VALID [2022-04-08 02:20:22,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {6961#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,087 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6961#true} {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 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] {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-08 02:20:22,087 INFO L290 TraceCheckUtils]: 61: Hoare triple {7131#(and (= main_~y~0 6) (< main_~c~0 (+ main_~k~0 6)) (= (+ main_~c~0 (- 6)) 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] {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} is VALID [2022-04-08 02:20:22,088 INFO L290 TraceCheckUtils]: 62: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 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] {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} is VALID [2022-04-08 02:20:22,088 INFO L290 TraceCheckUtils]: 63: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} is VALID [2022-04-08 02:20:22,088 INFO L272 TraceCheckUtils]: 64: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 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] {6961#true} is VALID [2022-04-08 02:20:22,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {6961#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] {6961#true} is VALID [2022-04-08 02:20:22,088 INFO L290 TraceCheckUtils]: 66: Hoare triple {6961#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[] {6961#true} is VALID [2022-04-08 02:20:22,098 INFO L290 TraceCheckUtils]: 67: Hoare triple {6961#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6961#true} is VALID [2022-04-08 02:20:22,107 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6961#true} {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 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] {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 main_~k~0)))} is VALID [2022-04-08 02:20:22,108 INFO L290 TraceCheckUtils]: 69: Hoare triple {7156#(and (= (+ main_~c~0 (- 7)) 0) (= 7 main_~y~0) (< main_~c~0 (+ 7 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] {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:22,108 INFO L290 TraceCheckUtils]: 70: Hoare triple {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 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] {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:22,109 INFO L290 TraceCheckUtils]: 71: Hoare triple {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 02:20:22,109 INFO L272 TraceCheckUtils]: 72: Hoare triple {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 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] {6961#true} is VALID [2022-04-08 02:20:22,109 INFO L290 TraceCheckUtils]: 73: Hoare triple {6961#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] {7194#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:20:22,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {7194#(= |__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[] {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:20:22,110 INFO L290 TraceCheckUtils]: 75: Hoare triple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:20:22,110 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} {7181#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 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] {7205#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~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 main_~y~0) 2)) (* main_~x~0 4)))} is VALID [2022-04-08 02:20:22,112 INFO L290 TraceCheckUtils]: 77: Hoare triple {7205#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~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 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] {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= main_~c~0 9))} is VALID [2022-04-08 02:20:22,112 INFO L290 TraceCheckUtils]: 78: Hoare triple {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= 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] {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= main_~c~0 9))} is VALID [2022-04-08 02:20:22,113 INFO L290 TraceCheckUtils]: 79: Hoare triple {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= main_~c~0 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= main_~c~0 9))} is VALID [2022-04-08 02:20:22,113 INFO L272 TraceCheckUtils]: 80: Hoare triple {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= 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] {6961#true} is VALID [2022-04-08 02:20:22,113 INFO L290 TraceCheckUtils]: 81: Hoare triple {6961#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] {7194#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:20:22,113 INFO L290 TraceCheckUtils]: 82: Hoare triple {7194#(= |__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[] {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:20:22,114 INFO L290 TraceCheckUtils]: 83: Hoare triple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:20:22,114 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7198#(not (= |__VERIFIER_assert_#in~cond| 0))} {7209#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~x~0 (+ (* main_~y~0 main_~y~0 main_~y~0) (div (+ (* (- 1) main_~y~0 main_~y~0) (* main_~y~0 main_~y~0 main_~y~0 2) (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (- 4)))) (<= 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] {7231#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 02:20:22,115 INFO L290 TraceCheckUtils]: 85: Hoare triple {7231#(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[] {7235#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 02:20:22,116 INFO L272 TraceCheckUtils]: 86: Hoare triple {7235#(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] {7239#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:20:22,116 INFO L290 TraceCheckUtils]: 87: Hoare triple {7239#(<= 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] {7243#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:20:22,116 INFO L290 TraceCheckUtils]: 88: Hoare triple {7243#(<= 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[] {6962#false} is VALID [2022-04-08 02:20:22,116 INFO L290 TraceCheckUtils]: 89: Hoare triple {6962#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6962#false} is VALID [2022-04-08 02:20:22,117 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-08 02:20:22,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:21:06,543 WARN L833 $PredicateComparison]: unable to prove that (or (= (+ (* c_main_~y~0 c_main_~k~0) c_main_~k~0) (+ (* 2 c_main_~y~0) (* c_main_~y~0 c_main_~y~0) 1)) (<= c_main_~k~0 c_main_~c~0) (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))) (< (+ c_main_~c~0 1) c_main_~k~0)) is different from false [2022-04-08 02:23:26,780 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 6 c_main_~y~0))) (or (not (= (mod (+ (* .cse0 .cse0 .cse0 6) (* .cse0 .cse0 13) (* .cse0 .cse0 .cse0 .cse0)) 4) 0)) (= (+ (* 2 c_main_~y~0) (* .cse0 .cse0) 13) (+ c_main_~k~0 (* .cse0 c_main_~k~0))) (< (+ 7 c_main_~c~0) c_main_~k~0) (<= c_main_~k~0 (+ 6 c_main_~c~0)))) is different from false [2022-04-08 02:23:37,165 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 7 c_main_~y~0))) (or (< (+ c_main_~c~0 8) c_main_~k~0) (not (= (mod (+ (* .cse0 .cse0 13) (* .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 .cse0 6)) 4) 0)) (<= c_main_~k~0 (+ 7 c_main_~c~0)) (= (+ (* 2 c_main_~y~0) 15 (* .cse0 .cse0)) (+ c_main_~k~0 (* .cse0 c_main_~k~0))))) is different from false [2022-04-08 02:23:47,289 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ 9 c_main_~c~0) main_~k~0) (= (+ (* main_~k~0 9) (* main_~k~0 c_main_~y~0)) (+ (* 18 c_main_~y~0) 81 (* c_main_~y~0 c_main_~y~0))) (<= main_~k~0 (+ c_main_~c~0 8)))) (not (= (mod (let ((.cse0 (+ 8 c_main_~y~0))) (+ (* .cse0 .cse0 .cse0 6) (* .cse0 .cse0 .cse0 .cse0) (* .cse0 .cse0 13))) 4) 0))) is different from false [2022-04-08 02:23:49,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:23:49,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043283770] [2022-04-08 02:23:49,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:23:49,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800722196] [2022-04-08 02:23:49,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800722196] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:23:49,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:23:49,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-08 02:23:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152491145] [2022-04-08 02:23:49,356 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:23:49,357 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-08 02:23:49,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:23:49,357 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-08 02:23:49,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:23:49,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 02:23:49,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:23:49,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 02:23:49,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=668, Unknown=16, NotChecked=228, Total=1056 [2022-04-08 02:23:49,409 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-08 02:23:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:50,840 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 02:23:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 02:23:50,840 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-08 02:23:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:23:50,841 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-08 02:23:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-08 02:23:50,842 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-08 02:23:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2022-04-08 02:23:50,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2022-04-08 02:23:50,902 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-08 02:23:50,903 INFO L225 Difference]: With dead ends: 100 [2022-04-08 02:23:50,903 INFO L226 Difference]: Without dead ends: 95 [2022-04-08 02:23:50,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 124.2s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=16, NotChecked=252, Total=1260 [2022-04-08 02:23:50,904 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 02:23:50,904 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 482 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 02:23:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-08 02:23:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-08 02:23:50,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:23:50,961 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-08 02:23:50,962 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-08 02:23:50,962 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-08 02:23:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:50,964 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-08 02:23:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-08 02:23:50,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:23:50,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:23:50,966 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-08 02:23:50,966 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-08 02:23:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:50,967 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2022-04-08 02:23:50,967 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-08 02:23:50,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:23:50,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:23:50,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:23:50,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:23:50,968 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-08 02:23:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-04-08 02:23:50,969 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 90 [2022-04-08 02:23:50,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:23:50,970 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-04-08 02:23:50,970 INFO L479 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-08 02:23:50,970 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-08 02:23:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 02:23:50,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:23:50,971 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:23:50,990 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-08 02:23:51,176 WARN L460 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-08 02:23:51,176 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:23:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:23:51,177 INFO L85 PathProgramCache]: Analyzing trace with hash -953190739, now seen corresponding path program 3 times [2022-04-08 02:23:51,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:23:51,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691098321] [2022-04-08 02:23:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:23:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:23:51,189 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:23:51,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [909025897] [2022-04-08 02:23:51,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-08 02:23:51,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:23:51,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:23:51,190 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-08 02:23:51,191 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-08 02:23:51,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-08 02:23:51,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:23:51,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 02:23:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:23:51,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:23:51,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {7966#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:51,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {7966#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] {7974#(<= ~counter~0 0)} is VALID [2022-04-08 02:23:51,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {7974#(<= ~counter~0 0)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7974#(<= ~counter~0 0)} is VALID [2022-04-08 02:23:51,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7974#(<= ~counter~0 0)} {7966#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7974#(<= ~counter~0 0)} is VALID [2022-04-08 02:23:51,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {7974#(<= ~counter~0 0)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7974#(<= ~counter~0 0)} is VALID [2022-04-08 02:23:51,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {7974#(<= ~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] {7974#(<= ~counter~0 0)} is VALID [2022-04-08 02:23:51,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {7974#(<= ~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] {7990#(<= ~counter~0 1)} is VALID [2022-04-08 02:23:51,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {7990#(<= ~counter~0 1)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7990#(<= ~counter~0 1)} is VALID [2022-04-08 02:23:51,614 INFO L272 TraceCheckUtils]: 8: Hoare triple {7990#(<= ~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] {7990#(<= ~counter~0 1)} is VALID [2022-04-08 02:23:51,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {7990#(<= ~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] {7990#(<= ~counter~0 1)} is VALID [2022-04-08 02:23:51,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {7990#(<= ~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[] {7990#(<= ~counter~0 1)} is VALID [2022-04-08 02:23:51,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {7990#(<= ~counter~0 1)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7990#(<= ~counter~0 1)} is VALID [2022-04-08 02:23:51,616 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7990#(<= ~counter~0 1)} {7990#(<= ~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] {7990#(<= ~counter~0 1)} is VALID [2022-04-08 02:23:51,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {7990#(<= ~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] {7990#(<= ~counter~0 1)} is VALID [2022-04-08 02:23:51,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {7990#(<= ~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] {8015#(<= ~counter~0 2)} is VALID [2022-04-08 02:23:51,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {8015#(<= ~counter~0 2)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8015#(<= ~counter~0 2)} is VALID [2022-04-08 02:23:51,617 INFO L272 TraceCheckUtils]: 16: Hoare triple {8015#(<= ~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] {8015#(<= ~counter~0 2)} is VALID [2022-04-08 02:23:51,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {8015#(<= ~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] {8015#(<= ~counter~0 2)} is VALID [2022-04-08 02:23:51,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {8015#(<= ~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[] {8015#(<= ~counter~0 2)} is VALID [2022-04-08 02:23:51,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {8015#(<= ~counter~0 2)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8015#(<= ~counter~0 2)} is VALID [2022-04-08 02:23:51,619 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8015#(<= ~counter~0 2)} {8015#(<= ~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] {8015#(<= ~counter~0 2)} is VALID [2022-04-08 02:23:51,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {8015#(<= ~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] {8015#(<= ~counter~0 2)} is VALID [2022-04-08 02:23:51,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {8015#(<= ~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] {8040#(<= ~counter~0 3)} is VALID [2022-04-08 02:23:51,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {8040#(<= ~counter~0 3)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8040#(<= ~counter~0 3)} is VALID [2022-04-08 02:23:51,620 INFO L272 TraceCheckUtils]: 24: Hoare triple {8040#(<= ~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] {8040#(<= ~counter~0 3)} is VALID [2022-04-08 02:23:51,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {8040#(<= ~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] {8040#(<= ~counter~0 3)} is VALID [2022-04-08 02:23:51,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {8040#(<= ~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[] {8040#(<= ~counter~0 3)} is VALID [2022-04-08 02:23:51,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {8040#(<= ~counter~0 3)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8040#(<= ~counter~0 3)} is VALID [2022-04-08 02:23:51,622 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8040#(<= ~counter~0 3)} {8040#(<= ~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] {8040#(<= ~counter~0 3)} is VALID [2022-04-08 02:23:51,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {8040#(<= ~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] {8040#(<= ~counter~0 3)} is VALID [2022-04-08 02:23:51,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {8040#(<= ~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] {8065#(<= ~counter~0 4)} is VALID [2022-04-08 02:23:51,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {8065#(<= ~counter~0 4)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8065#(<= ~counter~0 4)} is VALID [2022-04-08 02:23:51,655 INFO L272 TraceCheckUtils]: 32: Hoare triple {8065#(<= ~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] {8065#(<= ~counter~0 4)} is VALID [2022-04-08 02:23:51,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {8065#(<= ~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] {8065#(<= ~counter~0 4)} is VALID [2022-04-08 02:23:51,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {8065#(<= ~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[] {8065#(<= ~counter~0 4)} is VALID [2022-04-08 02:23:51,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {8065#(<= ~counter~0 4)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8065#(<= ~counter~0 4)} is VALID [2022-04-08 02:23:51,657 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8065#(<= ~counter~0 4)} {8065#(<= ~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] {8065#(<= ~counter~0 4)} is VALID [2022-04-08 02:23:51,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {8065#(<= ~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] {8065#(<= ~counter~0 4)} is VALID [2022-04-08 02:23:51,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {8065#(<= ~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] {8090#(<= ~counter~0 5)} is VALID [2022-04-08 02:23:51,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {8090#(<= ~counter~0 5)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8090#(<= ~counter~0 5)} is VALID [2022-04-08 02:23:51,658 INFO L272 TraceCheckUtils]: 40: Hoare triple {8090#(<= ~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] {8090#(<= ~counter~0 5)} is VALID [2022-04-08 02:23:51,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {8090#(<= ~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] {8090#(<= ~counter~0 5)} is VALID [2022-04-08 02:23:51,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {8090#(<= ~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[] {8090#(<= ~counter~0 5)} is VALID [2022-04-08 02:23:51,659 INFO L290 TraceCheckUtils]: 43: Hoare triple {8090#(<= ~counter~0 5)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8090#(<= ~counter~0 5)} is VALID [2022-04-08 02:23:51,659 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8090#(<= ~counter~0 5)} {8090#(<= ~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] {8090#(<= ~counter~0 5)} is VALID [2022-04-08 02:23:51,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {8090#(<= ~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] {8090#(<= ~counter~0 5)} is VALID [2022-04-08 02:23:51,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {8090#(<= ~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] {8115#(<= ~counter~0 6)} is VALID [2022-04-08 02:23:51,660 INFO L290 TraceCheckUtils]: 47: Hoare triple {8115#(<= ~counter~0 6)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8115#(<= ~counter~0 6)} is VALID [2022-04-08 02:23:51,660 INFO L272 TraceCheckUtils]: 48: Hoare triple {8115#(<= ~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] {8115#(<= ~counter~0 6)} is VALID [2022-04-08 02:23:51,660 INFO L290 TraceCheckUtils]: 49: Hoare triple {8115#(<= ~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] {8115#(<= ~counter~0 6)} is VALID [2022-04-08 02:23:51,661 INFO L290 TraceCheckUtils]: 50: Hoare triple {8115#(<= ~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[] {8115#(<= ~counter~0 6)} is VALID [2022-04-08 02:23:51,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {8115#(<= ~counter~0 6)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8115#(<= ~counter~0 6)} is VALID [2022-04-08 02:23:51,661 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8115#(<= ~counter~0 6)} {8115#(<= ~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] {8115#(<= ~counter~0 6)} is VALID [2022-04-08 02:23:51,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {8115#(<= ~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] {8115#(<= ~counter~0 6)} is VALID [2022-04-08 02:23:51,662 INFO L290 TraceCheckUtils]: 54: Hoare triple {8115#(<= ~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] {8140#(<= ~counter~0 7)} is VALID [2022-04-08 02:23:51,662 INFO L290 TraceCheckUtils]: 55: Hoare triple {8140#(<= ~counter~0 7)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8140#(<= ~counter~0 7)} is VALID [2022-04-08 02:23:51,663 INFO L272 TraceCheckUtils]: 56: Hoare triple {8140#(<= ~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] {8140#(<= ~counter~0 7)} is VALID [2022-04-08 02:23:51,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {8140#(<= ~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] {8140#(<= ~counter~0 7)} is VALID [2022-04-08 02:23:51,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {8140#(<= ~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[] {8140#(<= ~counter~0 7)} is VALID [2022-04-08 02:23:51,663 INFO L290 TraceCheckUtils]: 59: Hoare triple {8140#(<= ~counter~0 7)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8140#(<= ~counter~0 7)} is VALID [2022-04-08 02:23:51,664 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8140#(<= ~counter~0 7)} {8140#(<= ~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] {8140#(<= ~counter~0 7)} is VALID [2022-04-08 02:23:51,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {8140#(<= ~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] {8140#(<= ~counter~0 7)} is VALID [2022-04-08 02:23:51,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {8140#(<= ~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] {8165#(<= ~counter~0 8)} is VALID [2022-04-08 02:23:51,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {8165#(<= ~counter~0 8)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8165#(<= ~counter~0 8)} is VALID [2022-04-08 02:23:51,665 INFO L272 TraceCheckUtils]: 64: Hoare triple {8165#(<= ~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] {8165#(<= ~counter~0 8)} is VALID [2022-04-08 02:23:51,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {8165#(<= ~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] {8165#(<= ~counter~0 8)} is VALID [2022-04-08 02:23:51,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {8165#(<= ~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[] {8165#(<= ~counter~0 8)} is VALID [2022-04-08 02:23:51,665 INFO L290 TraceCheckUtils]: 67: Hoare triple {8165#(<= ~counter~0 8)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8165#(<= ~counter~0 8)} is VALID [2022-04-08 02:23:51,666 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8165#(<= ~counter~0 8)} {8165#(<= ~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] {8165#(<= ~counter~0 8)} is VALID [2022-04-08 02:23:51,666 INFO L290 TraceCheckUtils]: 69: Hoare triple {8165#(<= ~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] {8165#(<= ~counter~0 8)} is VALID [2022-04-08 02:23:51,667 INFO L290 TraceCheckUtils]: 70: Hoare triple {8165#(<= ~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] {8190#(<= ~counter~0 9)} is VALID [2022-04-08 02:23:51,667 INFO L290 TraceCheckUtils]: 71: Hoare triple {8190#(<= ~counter~0 9)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8190#(<= ~counter~0 9)} is VALID [2022-04-08 02:23:51,667 INFO L272 TraceCheckUtils]: 72: Hoare triple {8190#(<= ~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] {8190#(<= ~counter~0 9)} is VALID [2022-04-08 02:23:51,667 INFO L290 TraceCheckUtils]: 73: Hoare triple {8190#(<= ~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] {8190#(<= ~counter~0 9)} is VALID [2022-04-08 02:23:51,668 INFO L290 TraceCheckUtils]: 74: Hoare triple {8190#(<= ~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[] {8190#(<= ~counter~0 9)} is VALID [2022-04-08 02:23:51,668 INFO L290 TraceCheckUtils]: 75: Hoare triple {8190#(<= ~counter~0 9)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8190#(<= ~counter~0 9)} is VALID [2022-04-08 02:23:51,668 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8190#(<= ~counter~0 9)} {8190#(<= ~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] {8190#(<= ~counter~0 9)} is VALID [2022-04-08 02:23:51,668 INFO L290 TraceCheckUtils]: 77: Hoare triple {8190#(<= ~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] {8190#(<= ~counter~0 9)} is VALID [2022-04-08 02:23:51,669 INFO L290 TraceCheckUtils]: 78: Hoare triple {8190#(<= ~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] {8215#(<= ~counter~0 10)} is VALID [2022-04-08 02:23:51,669 INFO L290 TraceCheckUtils]: 79: Hoare triple {8215#(<= ~counter~0 10)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8215#(<= ~counter~0 10)} is VALID [2022-04-08 02:23:51,669 INFO L272 TraceCheckUtils]: 80: Hoare triple {8215#(<= ~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] {8215#(<= ~counter~0 10)} is VALID [2022-04-08 02:23:51,670 INFO L290 TraceCheckUtils]: 81: Hoare triple {8215#(<= ~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] {8215#(<= ~counter~0 10)} is VALID [2022-04-08 02:23:51,670 INFO L290 TraceCheckUtils]: 82: Hoare triple {8215#(<= ~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[] {8215#(<= ~counter~0 10)} is VALID [2022-04-08 02:23:51,670 INFO L290 TraceCheckUtils]: 83: Hoare triple {8215#(<= ~counter~0 10)} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8215#(<= ~counter~0 10)} is VALID [2022-04-08 02:23:51,670 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {8215#(<= ~counter~0 10)} {8215#(<= ~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] {8215#(<= ~counter~0 10)} is VALID [2022-04-08 02:23:51,671 INFO L290 TraceCheckUtils]: 85: Hoare triple {8215#(<= ~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] {8215#(<= ~counter~0 10)} is VALID [2022-04-08 02:23:51,671 INFO L290 TraceCheckUtils]: 86: Hoare triple {8215#(<= ~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] {8240#(<= |main_#t~post5| 10)} is VALID [2022-04-08 02:23:51,671 INFO L290 TraceCheckUtils]: 87: Hoare triple {8240#(<= |main_#t~post5| 10)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 100)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7967#false} is VALID [2022-04-08 02:23:51,672 INFO L272 TraceCheckUtils]: 88: Hoare triple {7967#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] {7967#false} is VALID [2022-04-08 02:23:51,672 INFO L290 TraceCheckUtils]: 89: Hoare triple {7967#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] {7967#false} is VALID [2022-04-08 02:23:51,673 INFO L290 TraceCheckUtils]: 90: Hoare triple {7967#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[] {7967#false} is VALID [2022-04-08 02:23:51,673 INFO L290 TraceCheckUtils]: 91: Hoare triple {7967#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7967#false} is VALID [2022-04-08 02:23:51,673 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-08 02:23:51,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:23:52,179 INFO L290 TraceCheckUtils]: 91: Hoare triple {7967#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7967#false} is VALID [2022-04-08 02:23:52,180 INFO L290 TraceCheckUtils]: 90: Hoare triple {7967#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[] {7967#false} is VALID [2022-04-08 02:23:52,180 INFO L290 TraceCheckUtils]: 89: Hoare triple {7967#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] {7967#false} is VALID [2022-04-08 02:23:52,180 INFO L272 TraceCheckUtils]: 88: Hoare triple {7967#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] {7967#false} is VALID [2022-04-08 02:23:52,180 INFO L290 TraceCheckUtils]: 87: Hoare triple {8268#(< |main_#t~post5| 100)} [69] L27-1-->L27-4: Formula: (not (< |v_main_#t~post5_2| 100)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {7967#false} is VALID [2022-04-08 02:23:52,180 INFO L290 TraceCheckUtils]: 86: Hoare triple {8272#(< ~counter~0 100)} [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] {8268#(< |main_#t~post5| 100)} is VALID [2022-04-08 02:23:52,181 INFO L290 TraceCheckUtils]: 85: Hoare triple {8272#(< ~counter~0 100)} [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 100)} is VALID [2022-04-08 02:23:52,181 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7966#true} {8272#(< ~counter~0 100)} [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 100)} is VALID [2022-04-08 02:23:52,181 INFO L290 TraceCheckUtils]: 83: Hoare triple {7966#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:52,181 INFO L290 TraceCheckUtils]: 82: Hoare triple {7966#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[] {7966#true} is VALID [2022-04-08 02:23:52,181 INFO L290 TraceCheckUtils]: 81: Hoare triple {7966#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] {7966#true} is VALID [2022-04-08 02:23:52,181 INFO L272 TraceCheckUtils]: 80: Hoare triple {8272#(< ~counter~0 100)} [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] {7966#true} is VALID [2022-04-08 02:23:52,182 INFO L290 TraceCheckUtils]: 79: Hoare triple {8272#(< ~counter~0 100)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8272#(< ~counter~0 100)} is VALID [2022-04-08 02:23:52,182 INFO L290 TraceCheckUtils]: 78: Hoare triple {8297#(< ~counter~0 99)} [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 100)} is VALID [2022-04-08 02:23:52,183 INFO L290 TraceCheckUtils]: 77: Hoare triple {8297#(< ~counter~0 99)} [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 99)} is VALID [2022-04-08 02:23:52,183 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7966#true} {8297#(< ~counter~0 99)} [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 99)} is VALID [2022-04-08 02:23:52,183 INFO L290 TraceCheckUtils]: 75: Hoare triple {7966#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:52,183 INFO L290 TraceCheckUtils]: 74: Hoare triple {7966#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[] {7966#true} is VALID [2022-04-08 02:23:52,183 INFO L290 TraceCheckUtils]: 73: Hoare triple {7966#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] {7966#true} is VALID [2022-04-08 02:23:52,184 INFO L272 TraceCheckUtils]: 72: Hoare triple {8297#(< ~counter~0 99)} [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] {7966#true} is VALID [2022-04-08 02:23:52,184 INFO L290 TraceCheckUtils]: 71: Hoare triple {8297#(< ~counter~0 99)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8297#(< ~counter~0 99)} is VALID [2022-04-08 02:23:52,184 INFO L290 TraceCheckUtils]: 70: Hoare triple {8322#(< ~counter~0 98)} [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 99)} is VALID [2022-04-08 02:23:52,185 INFO L290 TraceCheckUtils]: 69: Hoare triple {8322#(< ~counter~0 98)} [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 98)} is VALID [2022-04-08 02:23:52,185 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7966#true} {8322#(< ~counter~0 98)} [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 98)} is VALID [2022-04-08 02:23:52,185 INFO L290 TraceCheckUtils]: 67: Hoare triple {7966#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:52,185 INFO L290 TraceCheckUtils]: 66: Hoare triple {7966#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[] {7966#true} is VALID [2022-04-08 02:23:52,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {7966#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] {7966#true} is VALID [2022-04-08 02:23:52,185 INFO L272 TraceCheckUtils]: 64: Hoare triple {8322#(< ~counter~0 98)} [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] {7966#true} is VALID [2022-04-08 02:23:52,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {8322#(< ~counter~0 98)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8322#(< ~counter~0 98)} is VALID [2022-04-08 02:23:52,186 INFO L290 TraceCheckUtils]: 62: Hoare triple {8347#(< ~counter~0 97)} [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 98)} is VALID [2022-04-08 02:23:52,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {8347#(< ~counter~0 97)} [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 97)} is VALID [2022-04-08 02:23:52,187 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7966#true} {8347#(< ~counter~0 97)} [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 97)} is VALID [2022-04-08 02:23:52,187 INFO L290 TraceCheckUtils]: 59: Hoare triple {7966#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:52,187 INFO L290 TraceCheckUtils]: 58: Hoare triple {7966#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[] {7966#true} is VALID [2022-04-08 02:23:52,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {7966#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] {7966#true} is VALID [2022-04-08 02:23:52,187 INFO L272 TraceCheckUtils]: 56: Hoare triple {8347#(< ~counter~0 97)} [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] {7966#true} is VALID [2022-04-08 02:23:52,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {8347#(< ~counter~0 97)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8347#(< ~counter~0 97)} is VALID [2022-04-08 02:23:52,188 INFO L290 TraceCheckUtils]: 54: Hoare triple {8372#(< ~counter~0 96)} [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 97)} is VALID [2022-04-08 02:23:52,188 INFO L290 TraceCheckUtils]: 53: Hoare triple {8372#(< ~counter~0 96)} [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 96)} is VALID [2022-04-08 02:23:52,189 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7966#true} {8372#(< ~counter~0 96)} [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 96)} is VALID [2022-04-08 02:23:52,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {7966#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:52,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {7966#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[] {7966#true} is VALID [2022-04-08 02:23:52,189 INFO L290 TraceCheckUtils]: 49: Hoare triple {7966#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] {7966#true} is VALID [2022-04-08 02:23:52,189 INFO L272 TraceCheckUtils]: 48: Hoare triple {8372#(< ~counter~0 96)} [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] {7966#true} is VALID [2022-04-08 02:23:52,189 INFO L290 TraceCheckUtils]: 47: Hoare triple {8372#(< ~counter~0 96)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8372#(< ~counter~0 96)} is VALID [2022-04-08 02:23:52,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {8397#(< ~counter~0 95)} [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 96)} is VALID [2022-04-08 02:23:52,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {8397#(< ~counter~0 95)} [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] {8397#(< ~counter~0 95)} is VALID [2022-04-08 02:23:52,190 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7966#true} {8397#(< ~counter~0 95)} [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] {8397#(< ~counter~0 95)} is VALID [2022-04-08 02:23:52,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {7966#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:52,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {7966#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[] {7966#true} is VALID [2022-04-08 02:23:52,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {7966#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] {7966#true} is VALID [2022-04-08 02:23:52,191 INFO L272 TraceCheckUtils]: 40: Hoare triple {8397#(< ~counter~0 95)} [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] {7966#true} is VALID [2022-04-08 02:23:52,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {8397#(< ~counter~0 95)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8397#(< ~counter~0 95)} is VALID [2022-04-08 02:23:52,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {8422#(< ~counter~0 94)} [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] {8397#(< ~counter~0 95)} is VALID [2022-04-08 02:23:52,192 INFO L290 TraceCheckUtils]: 37: Hoare triple {8422#(< ~counter~0 94)} [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] {8422#(< ~counter~0 94)} is VALID [2022-04-08 02:23:52,192 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7966#true} {8422#(< ~counter~0 94)} [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] {8422#(< ~counter~0 94)} is VALID [2022-04-08 02:23:52,192 INFO L290 TraceCheckUtils]: 35: Hoare triple {7966#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:52,192 INFO L290 TraceCheckUtils]: 34: Hoare triple {7966#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[] {7966#true} is VALID [2022-04-08 02:23:52,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {7966#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] {7966#true} is VALID [2022-04-08 02:23:52,193 INFO L272 TraceCheckUtils]: 32: Hoare triple {8422#(< ~counter~0 94)} [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] {7966#true} is VALID [2022-04-08 02:23:52,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {8422#(< ~counter~0 94)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8422#(< ~counter~0 94)} is VALID [2022-04-08 02:23:52,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {8447#(< ~counter~0 93)} [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] {8422#(< ~counter~0 94)} is VALID [2022-04-08 02:23:52,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {8447#(< ~counter~0 93)} [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] {8447#(< ~counter~0 93)} is VALID [2022-04-08 02:23:52,194 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7966#true} {8447#(< ~counter~0 93)} [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] {8447#(< ~counter~0 93)} is VALID [2022-04-08 02:23:52,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {7966#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:52,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {7966#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[] {7966#true} is VALID [2022-04-08 02:23:52,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {7966#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] {7966#true} is VALID [2022-04-08 02:23:52,194 INFO L272 TraceCheckUtils]: 24: Hoare triple {8447#(< ~counter~0 93)} [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] {7966#true} is VALID [2022-04-08 02:23:52,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {8447#(< ~counter~0 93)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8447#(< ~counter~0 93)} is VALID [2022-04-08 02:23:52,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {8472#(< ~counter~0 92)} [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] {8447#(< ~counter~0 93)} is VALID [2022-04-08 02:23:52,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {8472#(< ~counter~0 92)} [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] {8472#(< ~counter~0 92)} is VALID [2022-04-08 02:23:52,196 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7966#true} {8472#(< ~counter~0 92)} [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] {8472#(< ~counter~0 92)} is VALID [2022-04-08 02:23:52,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {7966#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:52,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {7966#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[] {7966#true} is VALID [2022-04-08 02:23:52,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {7966#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] {7966#true} is VALID [2022-04-08 02:23:52,196 INFO L272 TraceCheckUtils]: 16: Hoare triple {8472#(< ~counter~0 92)} [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] {7966#true} is VALID [2022-04-08 02:23:52,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {8472#(< ~counter~0 92)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8472#(< ~counter~0 92)} is VALID [2022-04-08 02:23:52,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {8497#(< ~counter~0 91)} [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] {8472#(< ~counter~0 92)} is VALID [2022-04-08 02:23:52,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {8497#(< ~counter~0 91)} [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] {8497#(< ~counter~0 91)} is VALID [2022-04-08 02:23:52,198 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7966#true} {8497#(< ~counter~0 91)} [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] {8497#(< ~counter~0 91)} is VALID [2022-04-08 02:23:52,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {7966#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:52,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {7966#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[] {7966#true} is VALID [2022-04-08 02:23:52,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {7966#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] {7966#true} is VALID [2022-04-08 02:23:52,198 INFO L272 TraceCheckUtils]: 8: Hoare triple {8497#(< ~counter~0 91)} [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] {7966#true} is VALID [2022-04-08 02:23:52,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {8497#(< ~counter~0 91)} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {8497#(< ~counter~0 91)} is VALID [2022-04-08 02:23:52,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {8522#(< ~counter~0 90)} [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] {8497#(< ~counter~0 91)} is VALID [2022-04-08 02:23:52,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {8522#(< ~counter~0 90)} [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] {8522#(< ~counter~0 90)} is VALID [2022-04-08 02:23:52,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {8522#(< ~counter~0 90)} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8522#(< ~counter~0 90)} is VALID [2022-04-08 02:23:52,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8522#(< ~counter~0 90)} {7966#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8522#(< ~counter~0 90)} is VALID [2022-04-08 02:23:52,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {8522#(< ~counter~0 90)} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8522#(< ~counter~0 90)} is VALID [2022-04-08 02:23:52,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {7966#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] {8522#(< ~counter~0 90)} is VALID [2022-04-08 02:23:52,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {7966#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7966#true} is VALID [2022-04-08 02:23:52,201 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-08 02:23:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:23:52,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691098321] [2022-04-08 02:23:52,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:23:52,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909025897] [2022-04-08 02:23:52,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909025897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 02:23:52,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 02:23:52,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 02:23:52,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515181564] [2022-04-08 02:23:52,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 02:23:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) Word has length 92 [2022-04-08 02:23:52,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:23:52,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 02:23:52,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:23:52,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 02:23:52,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:23:52,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 02:23:52,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-08 02:23:52,312 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 02:23:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:53,322 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2022-04-08 02:23:53,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-08 02:23:53,322 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) Word has length 92 [2022-04-08 02:23:53,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:23:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 02:23:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 249 transitions. [2022-04-08 02:23:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 02:23:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 249 transitions. [2022-04-08 02:23:53,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 249 transitions. [2022-04-08 02:23:53,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 02:23:53,510 INFO L225 Difference]: With dead ends: 249 [2022-04-08 02:23:53,510 INFO L226 Difference]: Without dead ends: 244 [2022-04-08 02:23:53,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 02:23:53,511 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 318 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 02:23:53,511 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 222 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 02:23:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-04-08 02:23:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 189. [2022-04-08 02:23:53,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:23:53,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:53,613 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:53,613 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:53,616 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2022-04-08 02:23:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2022-04-08 02:23:53,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:23:53,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:23:53,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 244 states. [2022-04-08 02:23:53,617 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 244 states. [2022-04-08 02:23:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:53,621 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2022-04-08 02:23:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2022-04-08 02:23:53,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:23:53,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:23:53,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:23:53,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:23:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 140 states have internal predecessors, (153), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2022-04-08 02:23:53,624 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 92 [2022-04-08 02:23:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:23:53,624 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2022-04-08 02:23:53,624 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 22 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 02:23:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2022-04-08 02:23:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 02:23:53,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:23:53,625 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:23:53,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-08 02:23:53,841 WARN L460 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-08 02:23:53,842 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:23:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:23:53,842 INFO L85 PathProgramCache]: Analyzing trace with hash 138382379, now seen corresponding path program 10 times [2022-04-08 02:23:53,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:23:53,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636028488] [2022-04-08 02:23:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:23:53,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:23:53,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:23:53,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777416952] [2022-04-08 02:23:53,859 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 02:23:53,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:23:53,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:23:53,859 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-08 02:23:53,860 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-08 02:23:55,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 02:23:55,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:23:55,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 02:23:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:23:55,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:23:55,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {9681#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {9681#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9681#true} {9681#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {9681#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {9681#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] {9701#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:23:55,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {9701#(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] {9701#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:23:55,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {9701#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9701#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:23:55,476 INFO L272 TraceCheckUtils]: 8: Hoare triple {9701#(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] {9681#true} is VALID [2022-04-08 02:23:55,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {9681#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[] {9681#true} is VALID [2022-04-08 02:23:55,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {9681#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,476 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9681#true} {9701#(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] {9701#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:23:55,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {9701#(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] {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:23:55,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {9726#(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] {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:23:55,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:23:55,477 INFO L272 TraceCheckUtils]: 16: Hoare triple {9726#(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] {9681#true} is VALID [2022-04-08 02:23:55,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {9681#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[] {9681#true} is VALID [2022-04-08 02:23:55,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {9681#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,483 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9681#true} {9726#(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] {9726#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:23:55,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {9726#(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] {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 02:23:55,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {9751#(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] {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 02:23:55,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 02:23:55,484 INFO L272 TraceCheckUtils]: 24: Hoare triple {9751#(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] {9681#true} is VALID [2022-04-08 02:23:55,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {9681#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[] {9681#true} is VALID [2022-04-08 02:23:55,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {9681#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,485 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9681#true} {9751#(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] {9751#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 02:23:55,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {9751#(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] {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 02:23:55,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {9776#(and (= (+ (- 2) main_~y~0) 1) (= 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] {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 02:23:55,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 02:23:55,486 INFO L272 TraceCheckUtils]: 32: Hoare triple {9776#(and (= (+ (- 2) main_~y~0) 1) (= 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] {9681#true} is VALID [2022-04-08 02:23:55,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {9681#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[] {9681#true} is VALID [2022-04-08 02:23:55,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {9681#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,487 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9681#true} {9776#(and (= (+ (- 2) main_~y~0) 1) (= 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] {9776#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 02:23:55,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {9776#(and (= (+ (- 2) main_~y~0) 1) (= 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] {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 02:23:55,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {9801#(and (= (+ main_~y~0 (- 3)) 1) (= 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] {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 02:23:55,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 02:23:55,488 INFO L272 TraceCheckUtils]: 40: Hoare triple {9801#(and (= (+ main_~y~0 (- 3)) 1) (= 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] {9681#true} is VALID [2022-04-08 02:23:55,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {9681#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[] {9681#true} is VALID [2022-04-08 02:23:55,488 INFO L290 TraceCheckUtils]: 43: Hoare triple {9681#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,488 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9681#true} {9801#(and (= (+ main_~y~0 (- 3)) 1) (= 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] {9801#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 02:23:55,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {9801#(and (= (+ main_~y~0 (- 3)) 1) (= 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] {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 02:23:55,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {9826#(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] {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 02:23:55,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 02:23:55,489 INFO L272 TraceCheckUtils]: 48: Hoare triple {9826#(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] {9681#true} is VALID [2022-04-08 02:23:55,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {9681#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[] {9681#true} is VALID [2022-04-08 02:23:55,489 INFO L290 TraceCheckUtils]: 51: Hoare triple {9681#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,490 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9681#true} {9826#(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] {9826#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 02:23:55,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {9826#(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] {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:23:55,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 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] {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:23:55,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:23:55,491 INFO L272 TraceCheckUtils]: 56: Hoare triple {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 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] {9681#true} is VALID [2022-04-08 02:23:55,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,491 INFO L290 TraceCheckUtils]: 58: Hoare triple {9681#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[] {9681#true} is VALID [2022-04-08 02:23:55,492 INFO L290 TraceCheckUtils]: 59: Hoare triple {9681#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,492 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9681#true} {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 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] {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:23:55,492 INFO L290 TraceCheckUtils]: 61: Hoare triple {9851#(and (= 4 (+ (- 2) main_~c~0)) (= 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] {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 02:23:55,492 INFO L290 TraceCheckUtils]: 62: Hoare triple {9876#(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] {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 02:23:55,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 02:23:55,493 INFO L272 TraceCheckUtils]: 64: Hoare triple {9876#(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] {9681#true} is VALID [2022-04-08 02:23:55,493 INFO L290 TraceCheckUtils]: 65: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,493 INFO L290 TraceCheckUtils]: 66: Hoare triple {9681#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[] {9681#true} is VALID [2022-04-08 02:23:55,493 INFO L290 TraceCheckUtils]: 67: Hoare triple {9681#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,493 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9681#true} {9876#(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] {9876#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4))} is VALID [2022-04-08 02:23:55,494 INFO L290 TraceCheckUtils]: 69: Hoare triple {9876#(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] {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 02:23:55,494 INFO L290 TraceCheckUtils]: 70: Hoare triple {9901#(and (= 7 (+ (- 1) main_~y~0)) (= 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] {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 02:23:55,494 INFO L290 TraceCheckUtils]: 71: Hoare triple {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 02:23:55,494 INFO L272 TraceCheckUtils]: 72: Hoare triple {9901#(and (= 7 (+ (- 1) main_~y~0)) (= 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] {9681#true} is VALID [2022-04-08 02:23:55,494 INFO L290 TraceCheckUtils]: 73: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,494 INFO L290 TraceCheckUtils]: 74: Hoare triple {9681#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[] {9681#true} is VALID [2022-04-08 02:23:55,495 INFO L290 TraceCheckUtils]: 75: Hoare triple {9681#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,495 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9681#true} {9901#(and (= 7 (+ (- 1) main_~y~0)) (= 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] {9901#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8))} is VALID [2022-04-08 02:23:55,495 INFO L290 TraceCheckUtils]: 77: Hoare triple {9901#(and (= 7 (+ (- 1) main_~y~0)) (= 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] {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:23:55,495 INFO L290 TraceCheckUtils]: 78: Hoare triple {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) 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] {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:23:55,496 INFO L290 TraceCheckUtils]: 79: Hoare triple {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:23:55,496 INFO L272 TraceCheckUtils]: 80: Hoare triple {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) 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] {9681#true} is VALID [2022-04-08 02:23:55,496 INFO L290 TraceCheckUtils]: 81: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,496 INFO L290 TraceCheckUtils]: 82: Hoare triple {9681#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[] {9681#true} is VALID [2022-04-08 02:23:55,496 INFO L290 TraceCheckUtils]: 83: Hoare triple {9681#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,496 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {9681#true} {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) 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] {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:23:55,497 INFO L290 TraceCheckUtils]: 85: Hoare triple {9926#(and (= 7 (+ (- 2) main_~y~0)) (= (+ (- 1) 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] {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} is VALID [2022-04-08 02:23:55,497 INFO L290 TraceCheckUtils]: 86: Hoare triple {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 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] {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} is VALID [2022-04-08 02:23:55,497 INFO L290 TraceCheckUtils]: 87: Hoare triple {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} is VALID [2022-04-08 02:23:55,497 INFO L272 TraceCheckUtils]: 88: Hoare triple {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 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] {9681#true} is VALID [2022-04-08 02:23:55,497 INFO L290 TraceCheckUtils]: 89: Hoare triple {9681#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] {9681#true} is VALID [2022-04-08 02:23:55,497 INFO L290 TraceCheckUtils]: 90: Hoare triple {9681#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[] {9681#true} is VALID [2022-04-08 02:23:55,498 INFO L290 TraceCheckUtils]: 91: Hoare triple {9681#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9681#true} is VALID [2022-04-08 02:23:55,498 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {9681#true} {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 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] {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} is VALID [2022-04-08 02:23:55,499 INFO L290 TraceCheckUtils]: 93: Hoare triple {9951#(and (<= main_~c~0 10) (= 7 (+ main_~y~0 (- 3))) (< 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[] {9976#(and (<= main_~k~0 10) (= 7 (+ main_~y~0 (- 3))) (< 9 main_~k~0))} is VALID [2022-04-08 02:23:55,499 INFO L272 TraceCheckUtils]: 94: Hoare triple {9976#(and (<= main_~k~0 10) (= 7 (+ main_~y~0 (- 3))) (< 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] {9980#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:23:55,499 INFO L290 TraceCheckUtils]: 95: Hoare triple {9980#(<= 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] {9984#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:23:55,500 INFO L290 TraceCheckUtils]: 96: Hoare triple {9984#(<= 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[] {9682#false} is VALID [2022-04-08 02:23:55,500 INFO L290 TraceCheckUtils]: 97: Hoare triple {9682#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9682#false} is VALID [2022-04-08 02:23:55,500 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-08 02:23:55,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:23:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:23:55,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636028488] [2022-04-08 02:23:55,724 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:23:55,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777416952] [2022-04-08 02:23:55,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777416952] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:23:55,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:23:55,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 02:23:55,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844908360] [2022-04-08 02:23:55,724 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:23:55,725 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-08 02:23:55,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:23:55,726 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-08 02:23:55,759 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-08 02:23:55,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 02:23:55,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:23:55,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 02:23:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-08 02:23:55,760 INFO L87 Difference]: Start difference. First operand 189 states and 201 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-08 02:23:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:56,731 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2022-04-08 02:23:56,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 02:23:56,732 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-08 02:23:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:23:56,733 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-08 02:23:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-08 02:23:56,736 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-08 02:23:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-04-08 02:23:56,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 79 transitions. [2022-04-08 02:23:56,777 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-08 02:23:56,780 INFO L225 Difference]: With dead ends: 194 [2022-04-08 02:23:56,780 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 02:23:56,780 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-08 02:23:56,781 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 02:23:56,781 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 532 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 02:23:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 02:23:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-08 02:23:56,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:23:56,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:56,864 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:56,864 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:56,867 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2022-04-08 02:23:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2022-04-08 02:23:56,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:23:56,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:23:56,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:23:56,868 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:23:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:56,870 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2022-04-08 02:23:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2022-04-08 02:23:56,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:23:56,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:23:56,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:23:56,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:23:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 140 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2022-04-08 02:23:56,876 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 98 [2022-04-08 02:23:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:23:56,877 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2022-04-08 02:23:56,877 INFO L479 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-08 02:23:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2022-04-08 02:23:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-08 02:23:56,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:23:56,878 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:23:56,882 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-08 02:23:57,082 WARN L460 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-08 02:23:57,083 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:23:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:23:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1036328716, now seen corresponding path program 11 times [2022-04-08 02:23:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:23:57,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646846688] [2022-04-08 02:23:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:23:57,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:23:57,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:23:57,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860224109] [2022-04-08 02:23:57,097 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-08 02:23:57,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:23:57,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:23:57,110 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-08 02:23:57,111 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-08 02:23:57,672 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-08 02:23:57,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:23:57,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 02:23:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:23:57,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:23:58,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {10948#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {10948#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10948#true} {10948#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {10948#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {10948#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] {10968#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:23:58,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {10968#(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] {10968#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:23:58,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {10968#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10968#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:23:58,176 INFO L272 TraceCheckUtils]: 8: Hoare triple {10968#(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] {10948#true} is VALID [2022-04-08 02:23:58,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,176 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10948#true} {10968#(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] {10968#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:23:58,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {10968#(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] {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:23:58,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {10993#(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] {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:23:58,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:23:58,179 INFO L272 TraceCheckUtils]: 16: Hoare triple {10993#(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] {10948#true} is VALID [2022-04-08 02:23:58,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,180 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10948#true} {10993#(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] {10993#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 02:23:58,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {10993#(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] {11018#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:23:58,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {11018#(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] {11018#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:23:58,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {11018#(and (= main_~y~0 2) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11018#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:23:58,180 INFO L272 TraceCheckUtils]: 24: Hoare triple {11018#(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] {10948#true} is VALID [2022-04-08 02:23:58,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,181 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10948#true} {11018#(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] {11018#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:23:58,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {11018#(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] {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 02:23:58,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {11043#(and (= 2 (+ (- 1) main_~y~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] {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 02:23:58,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 02:23:58,182 INFO L272 TraceCheckUtils]: 32: Hoare triple {11043#(and (= 2 (+ (- 1) main_~y~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] {10948#true} is VALID [2022-04-08 02:23:58,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,182 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10948#true} {11043#(and (= 2 (+ (- 1) main_~y~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] {11043#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 02:23:58,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {11043#(and (= 2 (+ (- 1) main_~y~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] {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 02:23:58,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 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] {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 02:23:58,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 02:23:58,183 INFO L272 TraceCheckUtils]: 40: Hoare triple {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 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] {10948#true} is VALID [2022-04-08 02:23:58,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,183 INFO L290 TraceCheckUtils]: 42: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,184 INFO L290 TraceCheckUtils]: 43: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,184 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10948#true} {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 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] {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 02:23:58,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {11068#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 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] {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 02:23:58,184 INFO L290 TraceCheckUtils]: 46: Hoare triple {11093#(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] {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 02:23:58,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 02:23:58,185 INFO L272 TraceCheckUtils]: 48: Hoare triple {11093#(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] {10948#true} is VALID [2022-04-08 02:23:58,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,185 INFO L290 TraceCheckUtils]: 51: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,185 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10948#true} {11093#(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] {11093#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 02:23:58,186 INFO L290 TraceCheckUtils]: 53: Hoare triple {11093#(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] {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:23:58,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {11118#(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] {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:23:58,186 INFO L290 TraceCheckUtils]: 55: Hoare triple {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:23:58,186 INFO L272 TraceCheckUtils]: 56: Hoare triple {11118#(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] {10948#true} is VALID [2022-04-08 02:23:58,186 INFO L290 TraceCheckUtils]: 57: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,187 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10948#true} {11118#(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] {11118#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:23:58,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {11118#(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] {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 02:23:58,187 INFO L290 TraceCheckUtils]: 62: Hoare triple {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~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] {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 02:23:58,188 INFO L290 TraceCheckUtils]: 63: Hoare triple {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 02:23:58,188 INFO L272 TraceCheckUtils]: 64: Hoare triple {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~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] {10948#true} is VALID [2022-04-08 02:23:58,188 INFO L290 TraceCheckUtils]: 65: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,188 INFO L290 TraceCheckUtils]: 66: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,188 INFO L290 TraceCheckUtils]: 67: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,188 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10948#true} {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~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] {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 5))} is VALID [2022-04-08 02:23:58,189 INFO L290 TraceCheckUtils]: 69: Hoare triple {11143#(and (= 5 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~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] {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 02:23:58,189 INFO L290 TraceCheckUtils]: 70: Hoare triple {11168#(and (= (+ main_~y~0 (- 3)) 5) (= 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] {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 02:23:58,189 INFO L290 TraceCheckUtils]: 71: Hoare triple {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 02:23:58,189 INFO L272 TraceCheckUtils]: 72: Hoare triple {11168#(and (= (+ main_~y~0 (- 3)) 5) (= 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] {10948#true} is VALID [2022-04-08 02:23:58,189 INFO L290 TraceCheckUtils]: 73: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,189 INFO L290 TraceCheckUtils]: 74: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,189 INFO L290 TraceCheckUtils]: 75: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,190 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10948#true} {11168#(and (= (+ main_~y~0 (- 3)) 5) (= 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] {11168#(and (= (+ main_~y~0 (- 3)) 5) (= main_~c~0 8))} is VALID [2022-04-08 02:23:58,190 INFO L290 TraceCheckUtils]: 77: Hoare triple {11168#(and (= (+ main_~y~0 (- 3)) 5) (= 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] {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:23:58,190 INFO L290 TraceCheckUtils]: 78: Hoare triple {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) 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] {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:23:58,190 INFO L290 TraceCheckUtils]: 79: Hoare triple {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:23:58,191 INFO L272 TraceCheckUtils]: 80: Hoare triple {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) 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] {10948#true} is VALID [2022-04-08 02:23:58,191 INFO L290 TraceCheckUtils]: 81: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,191 INFO L290 TraceCheckUtils]: 82: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,191 INFO L290 TraceCheckUtils]: 83: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,191 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {10948#true} {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) 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] {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:23:58,191 INFO L290 TraceCheckUtils]: 85: Hoare triple {11193#(and (= 5 (+ main_~y~0 (- 4))) (= (+ (- 1) 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] {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:23:58,192 INFO L290 TraceCheckUtils]: 86: Hoare triple {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 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] {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:23:58,192 INFO L290 TraceCheckUtils]: 87: Hoare triple {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:23:58,192 INFO L272 TraceCheckUtils]: 88: Hoare triple {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 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] {10948#true} is VALID [2022-04-08 02:23:58,192 INFO L290 TraceCheckUtils]: 89: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,192 INFO L290 TraceCheckUtils]: 90: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,192 INFO L290 TraceCheckUtils]: 91: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,193 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {10948#true} {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 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] {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:23:58,193 INFO L290 TraceCheckUtils]: 93: Hoare triple {11218#(and (= 5 (+ main_~y~0 (- 5))) (= 8 (+ (- 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] {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} is VALID [2022-04-08 02:23:58,193 INFO L290 TraceCheckUtils]: 94: Hoare triple {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 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] {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} is VALID [2022-04-08 02:23:58,193 INFO L290 TraceCheckUtils]: 95: Hoare triple {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} is VALID [2022-04-08 02:23:58,194 INFO L272 TraceCheckUtils]: 96: Hoare triple {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 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] {10948#true} is VALID [2022-04-08 02:23:58,194 INFO L290 TraceCheckUtils]: 97: Hoare triple {10948#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] {10948#true} is VALID [2022-04-08 02:23:58,194 INFO L290 TraceCheckUtils]: 98: Hoare triple {10948#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[] {10948#true} is VALID [2022-04-08 02:23:58,194 INFO L290 TraceCheckUtils]: 99: Hoare triple {10948#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10948#true} is VALID [2022-04-08 02:23:58,194 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {10948#true} {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 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] {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} is VALID [2022-04-08 02:23:58,195 INFO L290 TraceCheckUtils]: 101: Hoare triple {11243#(and (<= main_~c~0 11) (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5))} [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[] {11268#(and (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5) (<= main_~k~0 11))} is VALID [2022-04-08 02:23:58,195 INFO L272 TraceCheckUtils]: 102: Hoare triple {11268#(and (< 10 main_~k~0) (= (+ main_~y~0 (- 6)) 5) (<= main_~k~0 11))} [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] {11272#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:23:58,195 INFO L290 TraceCheckUtils]: 103: Hoare triple {11272#(<= 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] {11276#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:23:58,195 INFO L290 TraceCheckUtils]: 104: Hoare triple {11276#(<= 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[] {10949#false} is VALID [2022-04-08 02:23:58,196 INFO L290 TraceCheckUtils]: 105: Hoare triple {10949#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10949#false} is VALID [2022-04-08 02:23:58,199 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-08 02:23:58,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:23:58,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:23:58,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646846688] [2022-04-08 02:23:58,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:23:58,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860224109] [2022-04-08 02:23:58,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860224109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:23:58,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:23:58,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-08 02:23:58,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446940846] [2022-04-08 02:23:58,417 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:23:58,418 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-08 02:23:58,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:23:58,418 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-08 02:23:58,456 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-08 02:23:58,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 02:23:58,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:23:58,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 02:23:58,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-08 02:23:58,457 INFO L87 Difference]: Start difference. First operand 189 states and 200 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-08 02:23:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:59,537 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2022-04-08 02:23:59,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 02:23:59,537 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-08 02:23:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:23:59,538 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-08 02:23:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-08 02:23:59,539 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-08 02:23:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 84 transitions. [2022-04-08 02:23:59,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 84 transitions. [2022-04-08 02:23:59,608 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-08 02:23:59,610 INFO L225 Difference]: With dead ends: 194 [2022-04-08 02:23:59,610 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 02:23:59,611 INFO L912 BasicCegarLoop]: 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-08 02:23:59,611 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 02:23:59,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 600 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 02:23:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 02:23:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-08 02:23:59,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:23:59,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:59,710 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:59,710 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:59,712 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2022-04-08 02:23:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2022-04-08 02:23:59,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:23:59,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:23:59,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:23:59,713 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:23:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:23:59,715 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2022-04-08 02:23:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2022-04-08 02:23:59,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:23:59,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:23:59,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:23:59,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:23:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0785714285714285) internal successors, (151), 140 states have internal predecessors, (151), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:23:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 199 transitions. [2022-04-08 02:23:59,719 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 199 transitions. Word has length 106 [2022-04-08 02:23:59,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:23:59,719 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 199 transitions. [2022-04-08 02:23:59,719 INFO L479 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-08 02:23:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2022-04-08 02:23:59,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-08 02:23:59,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:23:59,720 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:23:59,736 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-08 02:23:59,924 WARN L460 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-08 02:23:59,925 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:23:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:23:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1975402733, now seen corresponding path program 12 times [2022-04-08 02:23:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:23:59,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548911303] [2022-04-08 02:23:59,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:23:59,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:23:59,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:23:59,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [812151996] [2022-04-08 02:23:59,937 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 02:23:59,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:23:59,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:23:59,938 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-08 02:23:59,939 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-08 02:24:00,470 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 02:24:00,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:24:00,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-08 02:24:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:24:00,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:24:00,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {12240#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {12240#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12240#true} {12240#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {12240#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {12240#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] {12260#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:00,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {12260#(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] {12260#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:00,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {12260#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12260#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:00,850 INFO L272 TraceCheckUtils]: 8: Hoare triple {12260#(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] {12240#true} is VALID [2022-04-08 02:24:00,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,851 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12240#true} {12260#(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] {12260#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:00,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {12260#(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] {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:24:00,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {12285#(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] {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:24:00,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:24:00,852 INFO L272 TraceCheckUtils]: 16: Hoare triple {12285#(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] {12240#true} is VALID [2022-04-08 02:24:00,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,852 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {12240#true} {12285#(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] {12285#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:24:00,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {12285#(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] {12310#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:24:00,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {12310#(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] {12310#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:24:00,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {12310#(and (= main_~y~0 2) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12310#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:24:00,853 INFO L272 TraceCheckUtils]: 24: Hoare triple {12310#(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] {12240#true} is VALID [2022-04-08 02:24:00,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,854 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12240#true} {12310#(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] {12310#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:24:00,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {12310#(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] {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 02:24:00,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {12335#(and (= 2 (+ (- 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] {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 02:24:00,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 02:24:00,855 INFO L272 TraceCheckUtils]: 32: Hoare triple {12335#(and (= 2 (+ (- 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] {12240#true} is VALID [2022-04-08 02:24:00,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,855 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12240#true} {12335#(and (= 2 (+ (- 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] {12335#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 02:24:00,855 INFO L290 TraceCheckUtils]: 37: Hoare triple {12335#(and (= 2 (+ (- 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] {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 02:24:00,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {12360#(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] {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 02:24:00,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 02:24:00,856 INFO L272 TraceCheckUtils]: 40: Hoare triple {12360#(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] {12240#true} is VALID [2022-04-08 02:24:00,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,857 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12240#true} {12360#(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] {12360#(and (= 2 (+ (- 2) main_~c~0)) (= main_~y~0 4))} is VALID [2022-04-08 02:24:00,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {12360#(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] {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 02:24:00,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 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] {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 02:24:00,857 INFO L290 TraceCheckUtils]: 47: Hoare triple {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 02:24:00,857 INFO L272 TraceCheckUtils]: 48: Hoare triple {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 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] {12240#true} is VALID [2022-04-08 02:24:00,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,858 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12240#true} {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 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] {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 02:24:00,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {12385#(and (= 2 (+ main_~c~0 (- 3))) (= 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] {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:00,859 INFO L290 TraceCheckUtils]: 54: Hoare triple {12410#(and (= main_~y~0 6) (= 2 (+ 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] {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:00,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:00,859 INFO L272 TraceCheckUtils]: 56: Hoare triple {12410#(and (= main_~y~0 6) (= 2 (+ 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] {12240#true} is VALID [2022-04-08 02:24:00,859 INFO L290 TraceCheckUtils]: 57: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,859 INFO L290 TraceCheckUtils]: 58: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,859 INFO L290 TraceCheckUtils]: 59: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,859 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12240#true} {12410#(and (= main_~y~0 6) (= 2 (+ 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] {12410#(and (= main_~y~0 6) (= 2 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:00,860 INFO L290 TraceCheckUtils]: 61: Hoare triple {12410#(and (= main_~y~0 6) (= 2 (+ 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] {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:00,860 INFO L290 TraceCheckUtils]: 62: Hoare triple {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 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] {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:00,860 INFO L290 TraceCheckUtils]: 63: Hoare triple {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:00,860 INFO L272 TraceCheckUtils]: 64: Hoare triple {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 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] {12240#true} is VALID [2022-04-08 02:24:00,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,861 INFO L290 TraceCheckUtils]: 67: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,861 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12240#true} {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 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] {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:00,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {12435#(and (= 2 (+ main_~c~0 (- 5))) (= 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] {12460#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 02:24:00,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {12460#(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] {12460#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 02:24:00,862 INFO L290 TraceCheckUtils]: 71: Hoare triple {12460#(and (= main_~y~0 8) (= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12460#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 02:24:00,862 INFO L272 TraceCheckUtils]: 72: Hoare triple {12460#(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] {12240#true} is VALID [2022-04-08 02:24:00,862 INFO L290 TraceCheckUtils]: 73: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,862 INFO L290 TraceCheckUtils]: 74: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,862 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12240#true} {12460#(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] {12460#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 02:24:00,862 INFO L290 TraceCheckUtils]: 77: Hoare triple {12460#(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] {12485#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 02:24:00,863 INFO L290 TraceCheckUtils]: 78: Hoare triple {12485#(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] {12485#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 02:24:00,863 INFO L290 TraceCheckUtils]: 79: Hoare triple {12485#(and (= main_~y~0 9) (= main_~c~0 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12485#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 02:24:00,863 INFO L272 TraceCheckUtils]: 80: Hoare triple {12485#(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] {12240#true} is VALID [2022-04-08 02:24:00,863 INFO L290 TraceCheckUtils]: 81: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,863 INFO L290 TraceCheckUtils]: 82: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,863 INFO L290 TraceCheckUtils]: 83: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,864 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {12240#true} {12485#(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] {12485#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 02:24:00,864 INFO L290 TraceCheckUtils]: 85: Hoare triple {12485#(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] {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 02:24:00,864 INFO L290 TraceCheckUtils]: 86: Hoare triple {12510#(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] {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 02:24:00,864 INFO L290 TraceCheckUtils]: 87: Hoare triple {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 02:24:00,864 INFO L272 TraceCheckUtils]: 88: Hoare triple {12510#(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] {12240#true} is VALID [2022-04-08 02:24:00,865 INFO L290 TraceCheckUtils]: 89: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,865 INFO L290 TraceCheckUtils]: 90: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,865 INFO L290 TraceCheckUtils]: 91: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,865 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {12240#true} {12510#(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] {12510#(and (= main_~y~0 10) (= (+ (- 1) main_~c~0) 9))} is VALID [2022-04-08 02:24:00,865 INFO L290 TraceCheckUtils]: 93: Hoare triple {12510#(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] {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 02:24:00,866 INFO L290 TraceCheckUtils]: 94: Hoare triple {12535#(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] {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 02:24:00,866 INFO L290 TraceCheckUtils]: 95: Hoare triple {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 02:24:00,866 INFO L272 TraceCheckUtils]: 96: Hoare triple {12535#(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] {12240#true} is VALID [2022-04-08 02:24:00,866 INFO L290 TraceCheckUtils]: 97: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,866 INFO L290 TraceCheckUtils]: 98: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,866 INFO L290 TraceCheckUtils]: 99: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,866 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {12240#true} {12535#(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] {12535#(and (= main_~c~0 11) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 02:24:00,867 INFO L290 TraceCheckUtils]: 101: Hoare triple {12535#(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] {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 02:24:00,867 INFO L290 TraceCheckUtils]: 102: Hoare triple {12560#(and (= (+ (- 2) main_~y~0) 10) (<= 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] {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 02:24:00,867 INFO L290 TraceCheckUtils]: 103: Hoare triple {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 02:24:00,867 INFO L272 TraceCheckUtils]: 104: Hoare triple {12560#(and (= (+ (- 2) main_~y~0) 10) (<= 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] {12240#true} is VALID [2022-04-08 02:24:00,867 INFO L290 TraceCheckUtils]: 105: Hoare triple {12240#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] {12240#true} is VALID [2022-04-08 02:24:00,867 INFO L290 TraceCheckUtils]: 106: Hoare triple {12240#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[] {12240#true} is VALID [2022-04-08 02:24:00,868 INFO L290 TraceCheckUtils]: 107: Hoare triple {12240#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12240#true} is VALID [2022-04-08 02:24:00,868 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {12240#true} {12560#(and (= (+ (- 2) main_~y~0) 10) (<= 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] {12560#(and (= (+ (- 2) main_~y~0) 10) (<= main_~c~0 12) (< 11 main_~k~0))} is VALID [2022-04-08 02:24:00,868 INFO L290 TraceCheckUtils]: 109: Hoare triple {12560#(and (= (+ (- 2) main_~y~0) 10) (<= 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[] {12585#(and (= (+ (- 2) main_~y~0) 10) (< 11 main_~k~0) (<= main_~k~0 12))} is VALID [2022-04-08 02:24:00,869 INFO L272 TraceCheckUtils]: 110: Hoare triple {12585#(and (= (+ (- 2) main_~y~0) 10) (< 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] {12589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:24:00,869 INFO L290 TraceCheckUtils]: 111: Hoare triple {12589#(<= 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] {12593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:24:00,869 INFO L290 TraceCheckUtils]: 112: Hoare triple {12593#(<= 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[] {12241#false} is VALID [2022-04-08 02:24:00,883 INFO L290 TraceCheckUtils]: 113: Hoare triple {12241#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12241#false} is VALID [2022-04-08 02:24:00,884 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-08 02:24:00,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:24:01,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:24:01,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548911303] [2022-04-08 02:24:01,148 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:24:01,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812151996] [2022-04-08 02:24:01,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812151996] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:24:01,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:24:01,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-08 02:24:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941140312] [2022-04-08 02:24:01,148 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:24:01,149 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-08 02:24:01,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:24:01,149 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-08 02:24:01,192 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-08 02:24:01,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 02:24:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:24:01,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 02:24:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-08 02:24:01,193 INFO L87 Difference]: Start difference. First operand 189 states and 199 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-08 02:24:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:02,535 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2022-04-08 02:24:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 02:24:02,535 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-08 02:24:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:24:02,535 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-08 02:24:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-08 02:24:02,536 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-08 02:24:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-08 02:24:02,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 89 transitions. [2022-04-08 02:24:02,613 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-08 02:24:02,615 INFO L225 Difference]: With dead ends: 194 [2022-04-08 02:24:02,615 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 02:24:02,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-04-08 02:24:02,616 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-08 02:24:02,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 672 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 02:24:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 02:24:02,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-08 02:24:02,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:24:02,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:02,681 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:02,682 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:02,684 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2022-04-08 02:24:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 198 transitions. [2022-04-08 02:24:02,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:24:02,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:24:02,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:24:02,685 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:24:02,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:02,687 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2022-04-08 02:24:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 198 transitions. [2022-04-08 02:24:02,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:24:02,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:24:02,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:24:02,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:24:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0714285714285714) internal successors, (150), 140 states have internal predecessors, (150), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 198 transitions. [2022-04-08 02:24:02,690 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 198 transitions. Word has length 114 [2022-04-08 02:24:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:24:02,690 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 198 transitions. [2022-04-08 02:24:02,690 INFO L479 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-08 02:24:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 198 transitions. [2022-04-08 02:24:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 02:24:02,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:24:02,691 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:24:02,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-08 02:24:02,899 WARN L460 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-08 02:24:02,899 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:24:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:24:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash -953421362, now seen corresponding path program 13 times [2022-04-08 02:24:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:24:02,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794169079] [2022-04-08 02:24:02,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:24:02,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:24:02,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:24:02,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713535890] [2022-04-08 02:24:02,924 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-08 02:24:02,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:24:02,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:24:02,935 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-08 02:24:02,956 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-08 02:24:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:24:03,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-08 02:24:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:24:04,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:24:04,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {13557#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {13557#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13557#true} {13557#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {13557#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {13557#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] {13577#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:04,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {13577#(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] {13577#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:04,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {13577#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13577#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:04,733 INFO L272 TraceCheckUtils]: 8: Hoare triple {13577#(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] {13557#true} is VALID [2022-04-08 02:24:04,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,734 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13557#true} {13577#(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] {13577#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:04,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {13577#(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] {13602#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 02:24:04,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {13602#(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] {13602#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 02:24:04,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {13602#(and (= main_~y~0 1) (= main_~c~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13602#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 02:24:04,735 INFO L272 TraceCheckUtils]: 16: Hoare triple {13602#(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] {13557#true} is VALID [2022-04-08 02:24:04,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,736 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13557#true} {13602#(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] {13602#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 02:24:04,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {13602#(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] {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 02:24:04,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {13627#(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] {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 02:24:04,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 02:24:04,737 INFO L272 TraceCheckUtils]: 24: Hoare triple {13627#(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] {13557#true} is VALID [2022-04-08 02:24:04,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,737 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13557#true} {13627#(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] {13627#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 02:24:04,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {13627#(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] {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 02:24:04,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {13652#(and (= (+ (- 2) main_~y~0) 1) (= 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] {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 02:24:04,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 02:24:04,739 INFO L272 TraceCheckUtils]: 32: Hoare triple {13652#(and (= (+ (- 2) main_~y~0) 1) (= 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] {13557#true} is VALID [2022-04-08 02:24:04,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,739 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13557#true} {13652#(and (= (+ (- 2) main_~y~0) 1) (= 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] {13652#(and (= (+ (- 2) main_~y~0) 1) (= main_~c~0 3))} is VALID [2022-04-08 02:24:04,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {13652#(and (= (+ (- 2) main_~y~0) 1) (= 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] {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 02:24:04,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {13677#(and (= (+ main_~y~0 (- 3)) 1) (= 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] {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 02:24:04,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 02:24:04,741 INFO L272 TraceCheckUtils]: 40: Hoare triple {13677#(and (= (+ main_~y~0 (- 3)) 1) (= 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] {13557#true} is VALID [2022-04-08 02:24:04,741 INFO L290 TraceCheckUtils]: 41: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,741 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13557#true} {13677#(and (= (+ main_~y~0 (- 3)) 1) (= 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] {13677#(and (= (+ main_~y~0 (- 3)) 1) (= main_~c~0 4))} is VALID [2022-04-08 02:24:04,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {13677#(and (= (+ main_~y~0 (- 3)) 1) (= 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] {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 02:24:04,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 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] {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 02:24:04,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 02:24:04,742 INFO L272 TraceCheckUtils]: 48: Hoare triple {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 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] {13557#true} is VALID [2022-04-08 02:24:04,743 INFO L290 TraceCheckUtils]: 49: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,743 INFO L290 TraceCheckUtils]: 51: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,743 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13557#true} {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 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] {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 5 main_~c~0))} is VALID [2022-04-08 02:24:04,744 INFO L290 TraceCheckUtils]: 53: Hoare triple {13702#(and (= (+ main_~y~0 (- 4)) 1) (= 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] {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 02:24:04,744 INFO L290 TraceCheckUtils]: 54: Hoare triple {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 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] {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 02:24:04,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 02:24:04,744 INFO L272 TraceCheckUtils]: 56: Hoare triple {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 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] {13557#true} is VALID [2022-04-08 02:24:04,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,745 INFO L290 TraceCheckUtils]: 59: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,745 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13557#true} {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 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] {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 1))} is VALID [2022-04-08 02:24:04,745 INFO L290 TraceCheckUtils]: 61: Hoare triple {13727#(and (= main_~c~0 6) (= (+ main_~y~0 (- 5)) 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] {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 02:24:04,746 INFO L290 TraceCheckUtils]: 62: Hoare triple {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 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] {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 02:24:04,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 02:24:04,746 INFO L272 TraceCheckUtils]: 64: Hoare triple {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 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] {13557#true} is VALID [2022-04-08 02:24:04,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,747 INFO L290 TraceCheckUtils]: 67: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,747 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13557#true} {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 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] {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-08 02:24:04,747 INFO L290 TraceCheckUtils]: 69: Hoare triple {13752#(and (= (+ (- 1) main_~c~0) 6) (= (+ main_~y~0 (- 6)) 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] {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} is VALID [2022-04-08 02:24:04,748 INFO L290 TraceCheckUtils]: 70: Hoare triple {13777#(and (= (+ main_~y~0 (- 7)) 1) (= 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] {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} is VALID [2022-04-08 02:24:04,748 INFO L290 TraceCheckUtils]: 71: Hoare triple {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} is VALID [2022-04-08 02:24:04,748 INFO L272 TraceCheckUtils]: 72: Hoare triple {13777#(and (= (+ main_~y~0 (- 7)) 1) (= 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] {13557#true} is VALID [2022-04-08 02:24:04,748 INFO L290 TraceCheckUtils]: 73: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,748 INFO L290 TraceCheckUtils]: 74: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,748 INFO L290 TraceCheckUtils]: 75: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,749 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13557#true} {13777#(and (= (+ main_~y~0 (- 7)) 1) (= 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] {13777#(and (= (+ main_~y~0 (- 7)) 1) (= main_~c~0 8))} is VALID [2022-04-08 02:24:04,749 INFO L290 TraceCheckUtils]: 77: Hoare triple {13777#(and (= (+ main_~y~0 (- 7)) 1) (= 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] {13802#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 02:24:04,750 INFO L290 TraceCheckUtils]: 78: Hoare triple {13802#(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] {13802#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 02:24:04,750 INFO L290 TraceCheckUtils]: 79: Hoare triple {13802#(and (= main_~y~0 9) (= main_~c~0 9))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13802#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 02:24:04,750 INFO L272 TraceCheckUtils]: 80: Hoare triple {13802#(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] {13557#true} is VALID [2022-04-08 02:24:04,750 INFO L290 TraceCheckUtils]: 81: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,750 INFO L290 TraceCheckUtils]: 82: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,750 INFO L290 TraceCheckUtils]: 83: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,751 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {13557#true} {13802#(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] {13802#(and (= main_~y~0 9) (= main_~c~0 9))} is VALID [2022-04-08 02:24:04,751 INFO L290 TraceCheckUtils]: 85: Hoare triple {13802#(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] {13827#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 02:24:04,752 INFO L290 TraceCheckUtils]: 86: Hoare triple {13827#(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] {13827#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 02:24:04,752 INFO L290 TraceCheckUtils]: 87: Hoare triple {13827#(and (= main_~y~0 10) (= main_~c~0 10))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13827#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 02:24:04,752 INFO L272 TraceCheckUtils]: 88: Hoare triple {13827#(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] {13557#true} is VALID [2022-04-08 02:24:04,752 INFO L290 TraceCheckUtils]: 89: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,752 INFO L290 TraceCheckUtils]: 90: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,752 INFO L290 TraceCheckUtils]: 91: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,753 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {13557#true} {13827#(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] {13827#(and (= main_~y~0 10) (= main_~c~0 10))} is VALID [2022-04-08 02:24:04,753 INFO L290 TraceCheckUtils]: 93: Hoare triple {13827#(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] {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 02:24:04,753 INFO L290 TraceCheckUtils]: 94: Hoare triple {13852#(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] {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 02:24:04,754 INFO L290 TraceCheckUtils]: 95: Hoare triple {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 02:24:04,754 INFO L272 TraceCheckUtils]: 96: Hoare triple {13852#(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] {13557#true} is VALID [2022-04-08 02:24:04,754 INFO L290 TraceCheckUtils]: 97: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,754 INFO L290 TraceCheckUtils]: 98: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,754 INFO L290 TraceCheckUtils]: 99: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,755 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {13557#true} {13852#(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] {13852#(and (= (+ (- 1) main_~c~0) 10) (= main_~y~0 11))} is VALID [2022-04-08 02:24:04,757 INFO L290 TraceCheckUtils]: 101: Hoare triple {13852#(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] {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 02:24:04,758 INFO L290 TraceCheckUtils]: 102: Hoare triple {13877#(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] {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 02:24:04,758 INFO L290 TraceCheckUtils]: 103: Hoare triple {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 02:24:04,758 INFO L272 TraceCheckUtils]: 104: Hoare triple {13877#(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] {13557#true} is VALID [2022-04-08 02:24:04,758 INFO L290 TraceCheckUtils]: 105: Hoare triple {13557#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] {13557#true} is VALID [2022-04-08 02:24:04,758 INFO L290 TraceCheckUtils]: 106: Hoare triple {13557#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[] {13557#true} is VALID [2022-04-08 02:24:04,758 INFO L290 TraceCheckUtils]: 107: Hoare triple {13557#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13557#true} is VALID [2022-04-08 02:24:04,771 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {13557#true} {13877#(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] {13877#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 02:24:04,772 INFO L290 TraceCheckUtils]: 109: Hoare triple {13877#(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] {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 02:24:04,772 INFO L290 TraceCheckUtils]: 110: Hoare triple {13902#(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] {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 02:24:04,772 INFO L290 TraceCheckUtils]: 111: Hoare triple {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 02:24:04,773 INFO L272 TraceCheckUtils]: 112: Hoare triple {13902#(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] {13557#true} is VALID [2022-04-08 02:24:04,773 INFO L290 TraceCheckUtils]: 113: Hoare triple {13557#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] {13915#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:24:04,773 INFO L290 TraceCheckUtils]: 114: Hoare triple {13915#(= |__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[] {13919#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:24:04,773 INFO L290 TraceCheckUtils]: 115: Hoare triple {13919#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13919#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 02:24:04,774 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13919#(not (= |__VERIFIER_assert_#in~cond| 0))} {13902#(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] {13902#(and (< 12 main_~k~0) (<= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 02:24:04,774 INFO L290 TraceCheckUtils]: 117: Hoare triple {13902#(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[] {13929#(and (< 12 main_~k~0) (<= main_~k~0 13) (= main_~y~0 13))} is VALID [2022-04-08 02:24:04,775 INFO L272 TraceCheckUtils]: 118: Hoare triple {13929#(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] {13933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:24:04,775 INFO L290 TraceCheckUtils]: 119: Hoare triple {13933#(<= 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] {13937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:24:04,776 INFO L290 TraceCheckUtils]: 120: Hoare triple {13937#(<= 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[] {13558#false} is VALID [2022-04-08 02:24:04,776 INFO L290 TraceCheckUtils]: 121: Hoare triple {13558#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13558#false} is VALID [2022-04-08 02:24:04,776 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-08 02:24:04,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:24:23,129 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-08 02:24:25,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:24:25,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794169079] [2022-04-08 02:24:25,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:24:25,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713535890] [2022-04-08 02:24:25,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713535890] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:24:25,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:24:25,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-08 02:24:25,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145205470] [2022-04-08 02:24:25,197 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:24:25,197 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-08 02:24:25,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:24:25,197 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-08 02:24:25,262 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-08 02:24:25,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 02:24:25,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:24:25,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 02:24:25,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=539, Unknown=1, NotChecked=46, Total=650 [2022-04-08 02:24:25,263 INFO L87 Difference]: Start difference. First operand 189 states and 198 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-08 02:24:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:27,284 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2022-04-08 02:24:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 02:24:27,285 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-08 02:24:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:24:27,285 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-08 02:24:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-08 02:24:27,286 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-08 02:24:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-08 02:24:27,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 94 transitions. [2022-04-08 02:24:27,360 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-08 02:24:27,362 INFO L225 Difference]: With dead ends: 194 [2022-04-08 02:24:27,362 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 02:24:27,362 INFO L912 BasicCegarLoop]: 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-08 02:24:27,363 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 02:24:27,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 689 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 02:24:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 02:24:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-08 02:24:27,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:24:27,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:27,456 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:27,456 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:27,458 INFO L93 Difference]: Finished difference Result 189 states and 197 transitions. [2022-04-08 02:24:27,459 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2022-04-08 02:24:27,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:24:27,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:24:27,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:24:27,459 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:24:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:27,461 INFO L93 Difference]: Finished difference Result 189 states and 197 transitions. [2022-04-08 02:24:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2022-04-08 02:24:27,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:24:27,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:24:27,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:24:27,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:24:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0642857142857143) internal successors, (149), 140 states have internal predecessors, (149), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 197 transitions. [2022-04-08 02:24:27,464 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 197 transitions. Word has length 122 [2022-04-08 02:24:27,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:24:27,465 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 197 transitions. [2022-04-08 02:24:27,465 INFO L479 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-08 02:24:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2022-04-08 02:24:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-08 02:24:27,465 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:24:27,465 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:24:27,472 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-08 02:24:27,666 WARN L460 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-08 02:24:27,667 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:24:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:24:27,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1206963793, now seen corresponding path program 14 times [2022-04-08 02:24:27,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:24:27,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031706803] [2022-04-08 02:24:27,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:24:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:24:27,684 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:24:27,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037559618] [2022-04-08 02:24:27,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 02:24:27,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:24:27,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:24:27,685 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-08 02:24:27,686 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-08 02:24:28,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 02:24:28,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:24:28,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 02:24:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:24:28,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:24:29,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {14905#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {14905#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14905#true} {14905#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {14905#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {14905#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] {14925#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:29,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {14925#(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] {14925#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:29,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {14925#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14925#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:29,244 INFO L272 TraceCheckUtils]: 8: Hoare triple {14925#(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] {14905#true} is VALID [2022-04-08 02:24:29,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,245 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14905#true} {14925#(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] {14925#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:29,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {14925#(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] {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:24:29,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {14950#(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] {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:24:29,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:24:29,246 INFO L272 TraceCheckUtils]: 16: Hoare triple {14950#(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] {14905#true} is VALID [2022-04-08 02:24:29,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,247 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14905#true} {14950#(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] {14950#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 02:24:29,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {14950#(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] {14975#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:24:29,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {14975#(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] {14975#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:24:29,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {14975#(and (= main_~y~0 2) (= main_~c~0 2))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {14975#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:24:29,248 INFO L272 TraceCheckUtils]: 24: Hoare triple {14975#(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] {14905#true} is VALID [2022-04-08 02:24:29,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,248 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {14905#true} {14975#(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] {14975#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 02:24:29,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {14975#(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] {15000#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:24:29,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {15000#(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] {15000#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:24:29,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {15000#(and (= main_~y~0 3) (= main_~c~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15000#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:24:29,249 INFO L272 TraceCheckUtils]: 32: Hoare triple {15000#(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] {14905#true} is VALID [2022-04-08 02:24:29,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,250 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14905#true} {15000#(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] {15000#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 02:24:29,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {15000#(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] {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:29,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {15025#(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] {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:29,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:29,251 INFO L272 TraceCheckUtils]: 40: Hoare triple {15025#(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] {14905#true} is VALID [2022-04-08 02:24:29,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,251 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14905#true} {15025#(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] {15025#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:29,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {15025#(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] {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 02:24:29,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {15050#(and (= (+ (- 2) main_~y~0) 3) (= 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] {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 02:24:29,252 INFO L290 TraceCheckUtils]: 47: Hoare triple {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 02:24:29,253 INFO L272 TraceCheckUtils]: 48: Hoare triple {15050#(and (= (+ (- 2) main_~y~0) 3) (= 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] {14905#true} is VALID [2022-04-08 02:24:29,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,264 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14905#true} {15050#(and (= (+ (- 2) main_~y~0) 3) (= 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] {15050#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 02:24:29,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {15050#(and (= (+ (- 2) main_~y~0) 3) (= 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] {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 02:24:29,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {15075#(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] {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 02:24:29,265 INFO L290 TraceCheckUtils]: 55: Hoare triple {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 02:24:29,265 INFO L272 TraceCheckUtils]: 56: Hoare triple {15075#(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] {14905#true} is VALID [2022-04-08 02:24:29,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,265 INFO L290 TraceCheckUtils]: 59: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,265 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14905#true} {15075#(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] {15075#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 02:24:29,266 INFO L290 TraceCheckUtils]: 61: Hoare triple {15075#(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] {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:29,266 INFO L290 TraceCheckUtils]: 62: Hoare triple {15100#(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] {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:29,266 INFO L290 TraceCheckUtils]: 63: Hoare triple {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:29,266 INFO L272 TraceCheckUtils]: 64: Hoare triple {15100#(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] {14905#true} is VALID [2022-04-08 02:24:29,266 INFO L290 TraceCheckUtils]: 65: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,266 INFO L290 TraceCheckUtils]: 66: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,266 INFO L290 TraceCheckUtils]: 67: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,279 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14905#true} {15100#(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] {15100#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:29,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {15100#(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] {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 02:24:29,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {15125#(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] {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 02:24:29,280 INFO L290 TraceCheckUtils]: 71: Hoare triple {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 02:24:29,280 INFO L272 TraceCheckUtils]: 72: Hoare triple {15125#(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] {14905#true} is VALID [2022-04-08 02:24:29,280 INFO L290 TraceCheckUtils]: 73: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,281 INFO L290 TraceCheckUtils]: 74: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,281 INFO L290 TraceCheckUtils]: 75: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,281 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14905#true} {15125#(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] {15125#(and (= 7 (+ (- 1) main_~y~0)) (= 5 (+ main_~c~0 (- 3))))} is VALID [2022-04-08 02:24:29,281 INFO L290 TraceCheckUtils]: 77: Hoare triple {15125#(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] {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:29,282 INFO L290 TraceCheckUtils]: 78: Hoare triple {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ 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] {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:29,282 INFO L290 TraceCheckUtils]: 79: Hoare triple {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:29,282 INFO L272 TraceCheckUtils]: 80: Hoare triple {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ 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] {14905#true} is VALID [2022-04-08 02:24:29,282 INFO L290 TraceCheckUtils]: 81: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,282 INFO L290 TraceCheckUtils]: 82: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,282 INFO L290 TraceCheckUtils]: 83: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,283 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {14905#true} {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ 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] {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:29,283 INFO L290 TraceCheckUtils]: 85: Hoare triple {15150#(and (= 7 (+ (- 2) main_~y~0)) (= 5 (+ 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] {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} is VALID [2022-04-08 02:24:29,283 INFO L290 TraceCheckUtils]: 86: Hoare triple {15175#(and (= 5 (+ main_~c~0 (- 5))) (= 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] {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} is VALID [2022-04-08 02:24:29,284 INFO L290 TraceCheckUtils]: 87: Hoare triple {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} is VALID [2022-04-08 02:24:29,284 INFO L272 TraceCheckUtils]: 88: Hoare triple {15175#(and (= 5 (+ main_~c~0 (- 5))) (= 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] {14905#true} is VALID [2022-04-08 02:24:29,284 INFO L290 TraceCheckUtils]: 89: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,284 INFO L290 TraceCheckUtils]: 90: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,284 INFO L290 TraceCheckUtils]: 91: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,284 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14905#true} {15175#(and (= 5 (+ main_~c~0 (- 5))) (= 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] {15175#(and (= 5 (+ main_~c~0 (- 5))) (= main_~y~0 10))} is VALID [2022-04-08 02:24:29,285 INFO L290 TraceCheckUtils]: 93: Hoare triple {15175#(and (= 5 (+ main_~c~0 (- 5))) (= 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] {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 02:24:29,285 INFO L290 TraceCheckUtils]: 94: Hoare triple {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 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] {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 02:24:29,285 INFO L290 TraceCheckUtils]: 95: Hoare triple {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 02:24:29,286 INFO L272 TraceCheckUtils]: 96: Hoare triple {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 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] {14905#true} is VALID [2022-04-08 02:24:29,286 INFO L290 TraceCheckUtils]: 97: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,286 INFO L290 TraceCheckUtils]: 98: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,286 INFO L290 TraceCheckUtils]: 99: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,286 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {14905#true} {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 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] {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 1) main_~y~0) 10))} is VALID [2022-04-08 02:24:29,287 INFO L290 TraceCheckUtils]: 101: Hoare triple {15200#(and (= 5 (+ main_~c~0 (- 6))) (= (+ (- 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] {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-08 02:24:29,287 INFO L290 TraceCheckUtils]: 102: Hoare triple {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 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] {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-08 02:24:29,287 INFO L290 TraceCheckUtils]: 103: Hoare triple {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-08 02:24:29,287 INFO L272 TraceCheckUtils]: 104: Hoare triple {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 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] {14905#true} is VALID [2022-04-08 02:24:29,287 INFO L290 TraceCheckUtils]: 105: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,287 INFO L290 TraceCheckUtils]: 106: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,287 INFO L290 TraceCheckUtils]: 107: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,288 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {14905#true} {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 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] {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 5))} is VALID [2022-04-08 02:24:29,288 INFO L290 TraceCheckUtils]: 109: Hoare triple {15225#(and (= (+ (- 2) main_~y~0) 10) (= (+ main_~c~0 (- 7)) 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] {15250#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 02:24:29,289 INFO L290 TraceCheckUtils]: 110: Hoare triple {15250#(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] {15250#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 02:24:29,289 INFO L290 TraceCheckUtils]: 111: Hoare triple {15250#(and (= main_~c~0 13) (= main_~y~0 13))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15250#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 02:24:29,289 INFO L272 TraceCheckUtils]: 112: Hoare triple {15250#(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] {14905#true} is VALID [2022-04-08 02:24:29,289 INFO L290 TraceCheckUtils]: 113: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,289 INFO L290 TraceCheckUtils]: 114: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,289 INFO L290 TraceCheckUtils]: 115: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,290 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {14905#true} {15250#(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] {15250#(and (= main_~c~0 13) (= main_~y~0 13))} is VALID [2022-04-08 02:24:29,290 INFO L290 TraceCheckUtils]: 117: Hoare triple {15250#(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] {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 02:24:29,290 INFO L290 TraceCheckUtils]: 118: Hoare triple {15275#(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] {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 02:24:29,291 INFO L290 TraceCheckUtils]: 119: Hoare triple {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 02:24:29,291 INFO L272 TraceCheckUtils]: 120: Hoare triple {15275#(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] {14905#true} is VALID [2022-04-08 02:24:29,291 INFO L290 TraceCheckUtils]: 121: Hoare triple {14905#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] {14905#true} is VALID [2022-04-08 02:24:29,291 INFO L290 TraceCheckUtils]: 122: Hoare triple {14905#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[] {14905#true} is VALID [2022-04-08 02:24:29,291 INFO L290 TraceCheckUtils]: 123: Hoare triple {14905#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14905#true} is VALID [2022-04-08 02:24:29,291 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {14905#true} {15275#(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] {15275#(and (< 13 main_~k~0) (<= main_~c~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 02:24:29,292 INFO L290 TraceCheckUtils]: 125: Hoare triple {15275#(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[] {15300#(and (< 13 main_~k~0) (<= main_~k~0 14) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 02:24:29,293 INFO L272 TraceCheckUtils]: 126: Hoare triple {15300#(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] {15304#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:24:29,293 INFO L290 TraceCheckUtils]: 127: Hoare triple {15304#(<= 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] {15308#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:24:29,293 INFO L290 TraceCheckUtils]: 128: Hoare triple {15308#(<= 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[] {14906#false} is VALID [2022-04-08 02:24:29,294 INFO L290 TraceCheckUtils]: 129: Hoare triple {14906#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14906#false} is VALID [2022-04-08 02:24:29,294 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-08 02:24:29,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:24:29,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:24:29,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031706803] [2022-04-08 02:24:29,553 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:24:29,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037559618] [2022-04-08 02:24:29,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037559618] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:24:29,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:24:29,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2022-04-08 02:24:29,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729930141] [2022-04-08 02:24:29,554 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:24:29,554 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-08 02:24:29,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:24:29,555 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-08 02:24:29,618 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-08 02:24:29,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 02:24:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:24:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 02:24:29,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-08 02:24:29,618 INFO L87 Difference]: Start difference. First operand 189 states and 197 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-08 02:24:31,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:31,583 INFO L93 Difference]: Finished difference Result 194 states and 201 transitions. [2022-04-08 02:24:31,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 02:24:31,583 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-08 02:24:31,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:24:31,583 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-08 02:24:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-04-08 02:24:31,585 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-08 02:24:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-04-08 02:24:31,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 99 transitions. [2022-04-08 02:24:31,653 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-08 02:24:31,656 INFO L225 Difference]: With dead ends: 194 [2022-04-08 02:24:31,656 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 02:24:31,656 INFO L912 BasicCegarLoop]: 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-08 02:24:31,656 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-08 02:24:31,657 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 828 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 02:24:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 02:24:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-08 02:24:31,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:24:31,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:31,731 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:31,732 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:31,736 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2022-04-08 02:24:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2022-04-08 02:24:31,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:24:31,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:24:31,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:24:31,736 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:24:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:31,739 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2022-04-08 02:24:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2022-04-08 02:24:31,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:24:31,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:24:31,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:24:31,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:24:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 196 transitions. [2022-04-08 02:24:31,743 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 196 transitions. Word has length 130 [2022-04-08 02:24:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:24:31,743 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 196 transitions. [2022-04-08 02:24:31,743 INFO L479 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-08 02:24:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 196 transitions. [2022-04-08 02:24:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-08 02:24:31,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:24:31,744 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:24:31,762 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-08 02:24:31,952 WARN L460 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-08 02:24:31,952 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:24:31,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:24:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1030291600, now seen corresponding path program 15 times [2022-04-08 02:24:31,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:24:31,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055622542] [2022-04-08 02:24:31,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:24:31,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:24:31,972 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:24:31,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924940767] [2022-04-08 02:24:31,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-08 02:24:31,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:24:31,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:24:31,988 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-08 02:24:31,989 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-08 02:24:32,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-04-08 02:24:32,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:24:32,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-08 02:24:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:24:32,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:24:33,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {16272#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {16272#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16272#true} {16272#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {16272#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {16272#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] {16292#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:33,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {16292#(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] {16292#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:33,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {16292#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16292#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:33,652 INFO L272 TraceCheckUtils]: 8: Hoare triple {16292#(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] {16272#true} is VALID [2022-04-08 02:24:33,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,652 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16272#true} {16292#(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] {16292#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:33,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {16292#(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] {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 02:24:33,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~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] {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 02:24:33,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 02:24:33,653 INFO L272 TraceCheckUtils]: 16: Hoare triple {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~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] {16272#true} is VALID [2022-04-08 02:24:33,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,654 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16272#true} {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~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] {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 02:24:33,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {16317#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1) (< main_~c~0 (+ main_~k~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] {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:33,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~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] {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:33,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:33,656 INFO L272 TraceCheckUtils]: 24: Hoare triple {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~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] {16272#true} is VALID [2022-04-08 02:24:33,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,656 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16272#true} {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~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] {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 2)) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:33,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {16342#(and (= (+ (- 1) main_~y~0) 1) (< main_~c~0 (+ main_~k~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] {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 02:24:33,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~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] {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 02:24:33,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 02:24:33,658 INFO L272 TraceCheckUtils]: 32: Hoare triple {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~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] {16272#true} is VALID [2022-04-08 02:24:33,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,658 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16272#true} {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~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] {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 02:24:33,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {16367#(and (= (+ (- 2) main_~y~0) 1) (< main_~c~0 (+ main_~k~0 3)) (= (+ main_~c~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] {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {16392#(and (= main_~y~0 4) (= 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] {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,660 INFO L272 TraceCheckUtils]: 40: Hoare triple {16392#(and (= main_~y~0 4) (= 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] {16272#true} is VALID [2022-04-08 02:24:33,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,660 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16272#true} {16392#(and (= main_~y~0 4) (= 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] {16392#(and (= main_~y~0 4) (= main_~c~0 4) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {16392#(and (= main_~y~0 4) (= 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] {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 4) (= 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] {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,661 INFO L272 TraceCheckUtils]: 48: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 4) (= 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] {16272#true} is VALID [2022-04-08 02:24:33,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,661 INFO L290 TraceCheckUtils]: 50: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,662 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16272#true} {16417#(and (= (+ (- 1) main_~c~0) 4) (= 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] {16417#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {16417#(and (= (+ (- 1) main_~c~0) 4) (= 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] {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,662 INFO L290 TraceCheckUtils]: 54: Hoare triple {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~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] {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,663 INFO L290 TraceCheckUtils]: 55: Hoare triple {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,663 INFO L272 TraceCheckUtils]: 56: Hoare triple {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~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] {16272#true} is VALID [2022-04-08 02:24:33,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,663 INFO L290 TraceCheckUtils]: 59: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,663 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16272#true} {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~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] {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {16442#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~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] {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 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] {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,664 INFO L272 TraceCheckUtils]: 64: Hoare triple {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 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] {16272#true} is VALID [2022-04-08 02:24:33,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,665 INFO L290 TraceCheckUtils]: 67: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,665 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16272#true} {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 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] {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 4) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,666 INFO L290 TraceCheckUtils]: 69: Hoare triple {16467#(and (= 7 main_~y~0) (= (+ main_~c~0 (- 3)) 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] {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,666 INFO L290 TraceCheckUtils]: 70: Hoare triple {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 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] {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,667 INFO L290 TraceCheckUtils]: 71: Hoare triple {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,667 INFO L272 TraceCheckUtils]: 72: Hoare triple {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 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] {16272#true} is VALID [2022-04-08 02:24:33,667 INFO L290 TraceCheckUtils]: 73: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,667 INFO L290 TraceCheckUtils]: 74: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,667 INFO L290 TraceCheckUtils]: 75: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,667 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16272#true} {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 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] {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,668 INFO L290 TraceCheckUtils]: 77: Hoare triple {16492#(and (= 7 (+ (- 1) main_~y~0)) (= main_~c~0 8) (< 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] {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,668 INFO L290 TraceCheckUtils]: 78: Hoare triple {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 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] {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,668 INFO L290 TraceCheckUtils]: 79: Hoare triple {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,668 INFO L272 TraceCheckUtils]: 80: Hoare triple {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 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] {16272#true} is VALID [2022-04-08 02:24:33,668 INFO L290 TraceCheckUtils]: 81: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,668 INFO L290 TraceCheckUtils]: 82: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,669 INFO L290 TraceCheckUtils]: 83: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,669 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {16272#true} {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 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] {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,669 INFO L290 TraceCheckUtils]: 85: Hoare triple {16517#(and (= 7 (+ (- 2) main_~y~0)) (= main_~c~0 9) (< 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] {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,670 INFO L290 TraceCheckUtils]: 86: Hoare triple {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 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] {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,670 INFO L290 TraceCheckUtils]: 87: Hoare triple {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,670 INFO L272 TraceCheckUtils]: 88: Hoare triple {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 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] {16272#true} is VALID [2022-04-08 02:24:33,670 INFO L290 TraceCheckUtils]: 89: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,670 INFO L290 TraceCheckUtils]: 90: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,670 INFO L290 TraceCheckUtils]: 91: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,671 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16272#true} {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 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] {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,671 INFO L290 TraceCheckUtils]: 93: Hoare triple {16542#(and (= 7 (+ main_~y~0 (- 3))) (= (+ (- 1) main_~c~0) 9) (< 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] {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,671 INFO L290 TraceCheckUtils]: 94: Hoare triple {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 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] {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,672 INFO L290 TraceCheckUtils]: 95: Hoare triple {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,672 INFO L272 TraceCheckUtils]: 96: Hoare triple {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 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] {16272#true} is VALID [2022-04-08 02:24:33,672 INFO L290 TraceCheckUtils]: 97: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,672 INFO L290 TraceCheckUtils]: 98: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,672 INFO L290 TraceCheckUtils]: 99: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,672 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {16272#true} {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 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] {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,673 INFO L290 TraceCheckUtils]: 101: Hoare triple {16567#(and (= main_~c~0 11) (= main_~y~0 11) (< 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] {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,673 INFO L290 TraceCheckUtils]: 102: Hoare triple {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 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] {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,673 INFO L290 TraceCheckUtils]: 103: Hoare triple {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,674 INFO L272 TraceCheckUtils]: 104: Hoare triple {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 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] {16272#true} is VALID [2022-04-08 02:24:33,674 INFO L290 TraceCheckUtils]: 105: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,674 INFO L290 TraceCheckUtils]: 106: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,674 INFO L290 TraceCheckUtils]: 107: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,674 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16272#true} {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 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] {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 0 main_~k~0))} is VALID [2022-04-08 02:24:33,675 INFO L290 TraceCheckUtils]: 109: Hoare triple {16592#(and (= main_~c~0 12) (= (+ (- 1) main_~y~0) 11) (< 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] {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 02:24:33,675 INFO L290 TraceCheckUtils]: 110: Hoare triple {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= 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] {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 02:24:33,675 INFO L290 TraceCheckUtils]: 111: Hoare triple {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 02:24:33,675 INFO L272 TraceCheckUtils]: 112: Hoare triple {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= 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] {16272#true} is VALID [2022-04-08 02:24:33,675 INFO L290 TraceCheckUtils]: 113: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,675 INFO L290 TraceCheckUtils]: 114: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,675 INFO L290 TraceCheckUtils]: 115: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,676 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {16272#true} {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= 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] {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= main_~y~0 13))} is VALID [2022-04-08 02:24:33,676 INFO L290 TraceCheckUtils]: 117: Hoare triple {16617#(and (= (+ (- 1) main_~c~0) 12) (< 0 main_~k~0) (= 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] {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 02:24:33,677 INFO L290 TraceCheckUtils]: 118: Hoare triple {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 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] {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 02:24:33,677 INFO L290 TraceCheckUtils]: 119: Hoare triple {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 02:24:33,677 INFO L272 TraceCheckUtils]: 120: Hoare triple {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 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] {16272#true} is VALID [2022-04-08 02:24:33,677 INFO L290 TraceCheckUtils]: 121: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,677 INFO L290 TraceCheckUtils]: 122: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,677 INFO L290 TraceCheckUtils]: 123: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,677 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16272#true} {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 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] {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) main_~y~0) 13))} is VALID [2022-04-08 02:24:33,678 INFO L290 TraceCheckUtils]: 125: Hoare triple {16642#(and (= 12 (+ (- 2) main_~c~0)) (< 0 main_~k~0) (= (+ (- 1) 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] {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-08 02:24:33,679 INFO L290 TraceCheckUtils]: 126: Hoare triple {16667#(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] {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-08 02:24:33,679 INFO L290 TraceCheckUtils]: 127: Hoare triple {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-08 02:24:33,679 INFO L272 TraceCheckUtils]: 128: Hoare triple {16667#(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] {16272#true} is VALID [2022-04-08 02:24:33,679 INFO L290 TraceCheckUtils]: 129: Hoare triple {16272#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] {16272#true} is VALID [2022-04-08 02:24:33,679 INFO L290 TraceCheckUtils]: 130: Hoare triple {16272#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[] {16272#true} is VALID [2022-04-08 02:24:33,679 INFO L290 TraceCheckUtils]: 131: Hoare triple {16272#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16272#true} is VALID [2022-04-08 02:24:33,680 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {16272#true} {16667#(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] {16667#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~c~0 15))} is VALID [2022-04-08 02:24:33,681 INFO L290 TraceCheckUtils]: 133: Hoare triple {16667#(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[] {16692#(and (= main_~y~0 15) (< 14 main_~k~0) (<= main_~k~0 15))} is VALID [2022-04-08 02:24:33,682 INFO L272 TraceCheckUtils]: 134: Hoare triple {16692#(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] {16696#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:24:33,682 INFO L290 TraceCheckUtils]: 135: Hoare triple {16696#(<= 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] {16700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:24:33,682 INFO L290 TraceCheckUtils]: 136: Hoare triple {16700#(<= 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[] {16273#false} is VALID [2022-04-08 02:24:33,682 INFO L290 TraceCheckUtils]: 137: Hoare triple {16273#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16273#false} is VALID [2022-04-08 02:24:33,683 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-08 02:24:33,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:24:35,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:24:35,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055622542] [2022-04-08 02:24:35,152 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:24:35,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924940767] [2022-04-08 02:24:35,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924940767] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:24:35,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:24:35,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-08 02:24:35,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361818251] [2022-04-08 02:24:35,153 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:24:35,153 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-08 02:24:35,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:24:35,153 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-08 02:24:35,212 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-08 02:24:35,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 02:24:35,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:24:35,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 02:24:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1101, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 02:24:35,213 INFO L87 Difference]: Start difference. First operand 189 states and 196 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-08 02:24:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:37,640 INFO L93 Difference]: Finished difference Result 194 states and 200 transitions. [2022-04-08 02:24:37,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 02:24:37,640 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-08 02:24:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:24:37,640 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-08 02:24:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 104 transitions. [2022-04-08 02:24:37,643 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-08 02:24:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 104 transitions. [2022-04-08 02:24:37,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 104 transitions. [2022-04-08 02:24:37,822 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-08 02:24:37,825 INFO L225 Difference]: With dead ends: 194 [2022-04-08 02:24:37,825 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 02:24:37,825 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1245, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 02:24:37,826 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 02:24:37,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 912 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 02:24:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 02:24:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-08 02:24:37,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:24:37,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:37,912 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:37,912 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:37,915 INFO L93 Difference]: Finished difference Result 189 states and 195 transitions. [2022-04-08 02:24:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2022-04-08 02:24:37,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:24:37,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:24:37,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:24:37,915 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:24:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:37,918 INFO L93 Difference]: Finished difference Result 189 states and 195 transitions. [2022-04-08 02:24:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2022-04-08 02:24:37,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:24:37,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:24:37,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:24:37,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:24:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.05) internal successors, (147), 140 states have internal predecessors, (147), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 195 transitions. [2022-04-08 02:24:37,923 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 195 transitions. Word has length 138 [2022-04-08 02:24:37,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:24:37,923 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 195 transitions. [2022-04-08 02:24:37,923 INFO L479 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-08 02:24:37,923 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2022-04-08 02:24:37,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-08 02:24:37,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:24:37,924 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:24:37,932 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-08 02:24:38,130 WARN L460 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-08 02:24:38,131 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:24:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:24:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1153802639, now seen corresponding path program 16 times [2022-04-08 02:24:38,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:24:38,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453992573] [2022-04-08 02:24:38,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:24:38,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:24:38,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:24:38,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029870517] [2022-04-08 02:24:38,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 02:24:38,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:24:38,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:24:38,146 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-08 02:24:38,147 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-08 02:24:39,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 02:24:39,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 02:24:39,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-08 02:24:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 02:24:39,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 02:24:39,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {18014#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {18014#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18014#true} {18014#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {18014#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {18014#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] {18034#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:39,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {18034#(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] {18034#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:39,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {18034#(and (= main_~c~0 0) (= main_~y~0 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18034#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:39,731 INFO L272 TraceCheckUtils]: 8: Hoare triple {18034#(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] {18014#true} is VALID [2022-04-08 02:24:39,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,731 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18014#true} {18034#(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] {18034#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 02:24:39,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {18034#(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] {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 02:24:39,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {18059#(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] {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 02:24:39,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 02:24:39,732 INFO L272 TraceCheckUtils]: 16: Hoare triple {18059#(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] {18014#true} is VALID [2022-04-08 02:24:39,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,733 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {18014#true} {18059#(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] {18059#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 02:24:39,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {18059#(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] {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:39,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {18084#(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] {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:39,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:39,734 INFO L272 TraceCheckUtils]: 24: Hoare triple {18084#(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] {18014#true} is VALID [2022-04-08 02:24:39,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,735 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18014#true} {18084#(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] {18084#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:39,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {18084#(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] {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 02:24:39,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {18109#(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] {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 02:24:39,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 02:24:39,736 INFO L272 TraceCheckUtils]: 32: Hoare triple {18109#(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] {18014#true} is VALID [2022-04-08 02:24:39,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,736 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18014#true} {18109#(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] {18109#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 02:24:39,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {18109#(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] {18134#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 02:24:39,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {18134#(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] {18134#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 02:24:39,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {18134#(and (= main_~y~0 4) (= main_~c~0 4))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18134#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 02:24:39,738 INFO L272 TraceCheckUtils]: 40: Hoare triple {18134#(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] {18014#true} is VALID [2022-04-08 02:24:39,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,738 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18014#true} {18134#(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] {18134#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 02:24:39,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {18134#(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] {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 02:24:39,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {18159#(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] {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 02:24:39,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 02:24:39,739 INFO L272 TraceCheckUtils]: 48: Hoare triple {18159#(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] {18014#true} is VALID [2022-04-08 02:24:39,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,740 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18014#true} {18159#(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] {18159#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 02:24:39,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {18159#(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] {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:39,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {18184#(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] {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:39,741 INFO L290 TraceCheckUtils]: 55: Hoare triple {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:39,741 INFO L272 TraceCheckUtils]: 56: Hoare triple {18184#(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] {18014#true} is VALID [2022-04-08 02:24:39,741 INFO L290 TraceCheckUtils]: 57: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,741 INFO L290 TraceCheckUtils]: 58: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,741 INFO L290 TraceCheckUtils]: 59: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,742 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18014#true} {18184#(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] {18184#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 02:24:39,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {18184#(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] {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:39,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {18209#(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] {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:39,743 INFO L290 TraceCheckUtils]: 63: Hoare triple {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:39,743 INFO L272 TraceCheckUtils]: 64: Hoare triple {18209#(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] {18014#true} is VALID [2022-04-08 02:24:39,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,743 INFO L290 TraceCheckUtils]: 67: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,744 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18014#true} {18209#(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] {18209#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 02:24:39,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {18209#(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] {18234#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 02:24:39,744 INFO L290 TraceCheckUtils]: 70: Hoare triple {18234#(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] {18234#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 02:24:39,745 INFO L290 TraceCheckUtils]: 71: Hoare triple {18234#(and (= main_~y~0 8) (= main_~c~0 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18234#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 02:24:39,745 INFO L272 TraceCheckUtils]: 72: Hoare triple {18234#(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] {18014#true} is VALID [2022-04-08 02:24:39,745 INFO L290 TraceCheckUtils]: 73: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,745 INFO L290 TraceCheckUtils]: 74: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,745 INFO L290 TraceCheckUtils]: 75: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,746 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {18014#true} {18234#(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] {18234#(and (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 02:24:39,746 INFO L290 TraceCheckUtils]: 77: Hoare triple {18234#(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] {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:24:39,746 INFO L290 TraceCheckUtils]: 78: Hoare triple {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) 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] {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:24:39,747 INFO L290 TraceCheckUtils]: 79: Hoare triple {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:24:39,747 INFO L272 TraceCheckUtils]: 80: Hoare triple {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) 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] {18014#true} is VALID [2022-04-08 02:24:39,747 INFO L290 TraceCheckUtils]: 81: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,747 INFO L290 TraceCheckUtils]: 82: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,747 INFO L290 TraceCheckUtils]: 83: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,747 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18014#true} {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) 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] {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 8))} is VALID [2022-04-08 02:24:39,748 INFO L290 TraceCheckUtils]: 85: Hoare triple {18259#(and (= 8 (+ (- 1) main_~y~0)) (= (+ (- 1) 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] {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 02:24:39,748 INFO L290 TraceCheckUtils]: 86: Hoare triple {18284#(and (= (+ (- 2) main_~y~0) 8) (= 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] {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 02:24:39,748 INFO L290 TraceCheckUtils]: 87: Hoare triple {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 02:24:39,748 INFO L272 TraceCheckUtils]: 88: Hoare triple {18284#(and (= (+ (- 2) main_~y~0) 8) (= 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] {18014#true} is VALID [2022-04-08 02:24:39,748 INFO L290 TraceCheckUtils]: 89: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,748 INFO L290 TraceCheckUtils]: 90: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,749 INFO L290 TraceCheckUtils]: 91: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,749 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18014#true} {18284#(and (= (+ (- 2) main_~y~0) 8) (= 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] {18284#(and (= (+ (- 2) main_~y~0) 8) (= main_~c~0 10))} is VALID [2022-04-08 02:24:39,749 INFO L290 TraceCheckUtils]: 93: Hoare triple {18284#(and (= (+ (- 2) main_~y~0) 8) (= 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] {18309#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 02:24:39,750 INFO L290 TraceCheckUtils]: 94: Hoare triple {18309#(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] {18309#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 02:24:39,750 INFO L290 TraceCheckUtils]: 95: Hoare triple {18309#(and (= main_~c~0 11) (= main_~y~0 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18309#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 02:24:39,750 INFO L272 TraceCheckUtils]: 96: Hoare triple {18309#(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] {18014#true} is VALID [2022-04-08 02:24:39,750 INFO L290 TraceCheckUtils]: 97: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,750 INFO L290 TraceCheckUtils]: 98: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,750 INFO L290 TraceCheckUtils]: 99: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,750 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {18014#true} {18309#(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] {18309#(and (= main_~c~0 11) (= main_~y~0 11))} is VALID [2022-04-08 02:24:39,751 INFO L290 TraceCheckUtils]: 101: Hoare triple {18309#(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] {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 02:24:39,751 INFO L290 TraceCheckUtils]: 102: Hoare triple {18334#(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] {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 02:24:39,751 INFO L290 TraceCheckUtils]: 103: Hoare triple {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 02:24:39,752 INFO L272 TraceCheckUtils]: 104: Hoare triple {18334#(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] {18014#true} is VALID [2022-04-08 02:24:39,752 INFO L290 TraceCheckUtils]: 105: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,752 INFO L290 TraceCheckUtils]: 106: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,752 INFO L290 TraceCheckUtils]: 107: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,752 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18014#true} {18334#(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] {18334#(and (= (+ (- 1) main_~c~0) 11) (= (+ (- 1) main_~y~0) 11))} is VALID [2022-04-08 02:24:39,752 INFO L290 TraceCheckUtils]: 109: Hoare triple {18334#(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] {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 02:24:39,753 INFO L290 TraceCheckUtils]: 110: Hoare triple {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 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] {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 02:24:39,753 INFO L290 TraceCheckUtils]: 111: Hoare triple {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 02:24:39,753 INFO L272 TraceCheckUtils]: 112: Hoare triple {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 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] {18014#true} is VALID [2022-04-08 02:24:39,753 INFO L290 TraceCheckUtils]: 113: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,753 INFO L290 TraceCheckUtils]: 114: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,753 INFO L290 TraceCheckUtils]: 115: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,754 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {18014#true} {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 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] {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 2) main_~y~0) 11))} is VALID [2022-04-08 02:24:39,754 INFO L290 TraceCheckUtils]: 117: Hoare triple {18359#(and (= 11 (+ (- 2) main_~c~0)) (= (+ (- 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] {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 02:24:39,754 INFO L290 TraceCheckUtils]: 118: Hoare triple {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~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] {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 02:24:39,755 INFO L290 TraceCheckUtils]: 119: Hoare triple {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 02:24:39,755 INFO L272 TraceCheckUtils]: 120: Hoare triple {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~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] {18014#true} is VALID [2022-04-08 02:24:39,755 INFO L290 TraceCheckUtils]: 121: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,755 INFO L290 TraceCheckUtils]: 122: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,755 INFO L290 TraceCheckUtils]: 123: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,755 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {18014#true} {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~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] {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~0 (- 3)) 11))} is VALID [2022-04-08 02:24:39,756 INFO L290 TraceCheckUtils]: 125: Hoare triple {18384#(and (= (+ main_~y~0 (- 3)) 11) (= (+ main_~c~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] {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:39,756 INFO L290 TraceCheckUtils]: 126: Hoare triple {18409#(and (= main_~y~0 15) (= 11 (+ 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] {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:39,756 INFO L290 TraceCheckUtils]: 127: Hoare triple {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:39,756 INFO L272 TraceCheckUtils]: 128: Hoare triple {18409#(and (= main_~y~0 15) (= 11 (+ 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] {18014#true} is VALID [2022-04-08 02:24:39,756 INFO L290 TraceCheckUtils]: 129: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,757 INFO L290 TraceCheckUtils]: 130: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,757 INFO L290 TraceCheckUtils]: 131: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,764 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {18014#true} {18409#(and (= main_~y~0 15) (= 11 (+ 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] {18409#(and (= main_~y~0 15) (= 11 (+ main_~c~0 (- 4))))} is VALID [2022-04-08 02:24:39,765 INFO L290 TraceCheckUtils]: 133: Hoare triple {18409#(and (= main_~y~0 15) (= 11 (+ 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] {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 02:24:39,765 INFO L290 TraceCheckUtils]: 134: Hoare triple {18434#(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] {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 02:24:39,765 INFO L290 TraceCheckUtils]: 135: Hoare triple {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} [70] L27-1-->L28: Formula: (< |v_main_#t~post5_4| 100) InVars {main_#t~post5=|v_main_#t~post5_4|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 02:24:39,766 INFO L272 TraceCheckUtils]: 136: Hoare triple {18434#(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] {18014#true} is VALID [2022-04-08 02:24:39,766 INFO L290 TraceCheckUtils]: 137: Hoare triple {18014#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] {18014#true} is VALID [2022-04-08 02:24:39,766 INFO L290 TraceCheckUtils]: 138: Hoare triple {18014#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[] {18014#true} is VALID [2022-04-08 02:24:39,766 INFO L290 TraceCheckUtils]: 139: Hoare triple {18014#true} [82] L10-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18014#true} is VALID [2022-04-08 02:24:39,766 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {18014#true} {18434#(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] {18434#(and (= main_~y~0 16) (< 15 main_~k~0) (<= main_~c~0 16))} is VALID [2022-04-08 02:24:39,768 INFO L290 TraceCheckUtils]: 141: Hoare triple {18434#(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[] {18459#(and (<= main_~k~0 16) (= main_~y~0 16) (< 15 main_~k~0))} is VALID [2022-04-08 02:24:39,768 INFO L272 TraceCheckUtils]: 142: Hoare triple {18459#(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] {18463#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 02:24:39,768 INFO L290 TraceCheckUtils]: 143: Hoare triple {18463#(<= 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] {18467#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 02:24:39,769 INFO L290 TraceCheckUtils]: 144: Hoare triple {18467#(<= 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[] {18015#false} is VALID [2022-04-08 02:24:39,769 INFO L290 TraceCheckUtils]: 145: Hoare triple {18015#false} [80] L11-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18015#false} is VALID [2022-04-08 02:24:39,769 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-08 02:24:39,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 02:24:40,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 02:24:40,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453992573] [2022-04-08 02:24:40,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 02:24:40,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029870517] [2022-04-08 02:24:40,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029870517] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 02:24:40,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 02:24:40,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-04-08 02:24:40,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641456814] [2022-04-08 02:24:40,111 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-08 02:24:40,112 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-08 02:24:40,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 02:24:40,112 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-08 02:24:40,177 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-08 02:24:40,178 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 02:24:40,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 02:24:40,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 02:24:40,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-08 02:24:40,178 INFO L87 Difference]: Start difference. First operand 189 states and 195 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-08 02:24:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:42,960 INFO L93 Difference]: Finished difference Result 194 states and 199 transitions. [2022-04-08 02:24:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 02:24:42,961 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-08 02:24:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 02:24:42,961 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-08 02:24:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2022-04-08 02:24:42,962 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-08 02:24:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 109 transitions. [2022-04-08 02:24:42,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 109 transitions. [2022-04-08 02:24:43,108 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-08 02:24:43,111 INFO L225 Difference]: With dead ends: 194 [2022-04-08 02:24:43,111 INFO L226 Difference]: Without dead ends: 189 [2022-04-08 02:24:43,111 INFO L912 BasicCegarLoop]: 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-08 02:24:43,111 INFO L913 BasicCegarLoop]: 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-08 02:24:43,112 INFO L914 BasicCegarLoop]: 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-08 02:24:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-08 02:24:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-08 02:24:43,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 02:24:43,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:43,239 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:43,239 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:43,241 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2022-04-08 02:24:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2022-04-08 02:24:43,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:24:43,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:24:43,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:24:43,242 INFO L87 Difference]: Start difference. First operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 189 states. [2022-04-08 02:24:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 02:24:43,244 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2022-04-08 02:24:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2022-04-08 02:24:43,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 02:24:43,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 02:24:43,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 02:24:43,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 02:24:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 140 states have (on average 1.042857142857143) internal successors, (146), 140 states have internal predecessors, (146), 25 states have call successors, (25), 25 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 02:24:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2022-04-08 02:24:43,247 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 194 transitions. Word has length 146 [2022-04-08 02:24:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 02:24:43,247 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 194 transitions. [2022-04-08 02:24:43,247 INFO L479 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-08 02:24:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2022-04-08 02:24:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-08 02:24:43,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 02:24:43,248 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 02:24:43,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-08 02:24:43,454 WARN L460 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-08 02:24:43,454 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 02:24:43,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 02:24:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash 75778898, now seen corresponding path program 17 times [2022-04-08 02:24:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 02:24:43,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740120395] [2022-04-08 02:24:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 02:24:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 02:24:43,489 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 02:24:43,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21236825] [2022-04-08 02:24:43,489 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-08 02:24:43,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 02:24:43,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 02:24:43,490 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-08 02:24:43,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process