/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/egcd3-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 00:49:46,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 00:49:46,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 00:49:46,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 00:49:46,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 00:49:46,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 00:49:46,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 00:49:46,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 00:49:46,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 00:49:46,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 00:49:46,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 00:49:46,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 00:49:46,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 00:49:46,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 00:49:46,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 00:49:46,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 00:49:46,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 00:49:46,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 00:49:46,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 00:49:46,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 00:49:46,573 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 00:49:46,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 00:49:46,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 00:49:46,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 00:49:46,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 00:49:46,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 00:49:46,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 00:49:46,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 00:49:46,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 00:49:46,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 00:49:46,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 00:49:46,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 00:49:46,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 00:49:46,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 00:49:46,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 00:49:46,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 00:49:46,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 00:49:46,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 00:49:46,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 00:49:46,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 00:49:46,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 00:49:46,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 00:49:46,591 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 00:49:46,618 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 00:49:46,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 00:49:46,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 00:49:46,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 00:49:46,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 00:49:46,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 00:49:46,620 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 00:49:46,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 00:49:46,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 00:49:46,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 00:49:46,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 00:49:46,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 00:49:46,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 00:49:46,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 00:49:46,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 00:49:46,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 00:49:46,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 00:49:46,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 00:49:46,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 00:49:46,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 00:49:46,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 00:49:46,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 00:49:46,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 00:49:46,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 00:49:46,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 00:49:46,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 00:49:46,624 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 00:49:46,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 00:49:46,625 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 00:49:46,625 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 00:49:46,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 00:49:46,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 00:49:46,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 00:49:46,904 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 00:49:46,904 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 00:49:46,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound10.c [2022-04-08 00:49:46,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87360e47/c91b69a88e8843089f52bc69f0b52a71/FLAGa8a64cd90 [2022-04-08 00:49:47,376 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 00:49:47,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound10.c [2022-04-08 00:49:47,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87360e47/c91b69a88e8843089f52bc69f0b52a71/FLAGa8a64cd90 [2022-04-08 00:49:47,398 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87360e47/c91b69a88e8843089f52bc69f0b52a71 [2022-04-08 00:49:47,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 00:49:47,401 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 00:49:47,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 00:49:47,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 00:49:47,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 00:49:47,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:49:47" (1/1) ... [2022-04-08 00:49:47,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366153b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:49:47, skipping insertion in model container [2022-04-08 00:49:47,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:49:47" (1/1) ... [2022-04-08 00:49:47,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 00:49:47,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 00:49:47,614 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/egcd3-ll_unwindbound10.c[490,503] [2022-04-08 00:49:47,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 00:49:47,660 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 00:49:47,675 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/egcd3-ll_unwindbound10.c[490,503] [2022-04-08 00:49:47,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 00:49:47,710 INFO L208 MainTranslator]: Completed translation [2022-04-08 00:49:47,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:49:47 WrapperNode [2022-04-08 00:49:47,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 00:49:47,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 00:49:47,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 00:49:47,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 00:49:47,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:49:47" (1/1) ... [2022-04-08 00:49:47,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:49:47" (1/1) ... [2022-04-08 00:49:47,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:49:47" (1/1) ... [2022-04-08 00:49:47,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:49:47" (1/1) ... [2022-04-08 00:49:47,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:49:47" (1/1) ... [2022-04-08 00:49:47,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:49:47" (1/1) ... [2022-04-08 00:49:47,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:49:47" (1/1) ... [2022-04-08 00:49:47,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 00:49:47,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 00:49:47,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 00:49:47,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 00:49:47,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:49:47" (1/1) ... [2022-04-08 00:49:47,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 00:49:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:49:47,780 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 00:49:47,793 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 00:49:47,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 00:49:47,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 00:49:47,817 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 00:49:47,817 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 00:49:47,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 00:49:47,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 00:49:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 00:49:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 00:49:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 00:49:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 00:49:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 00:49:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 00:49:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 00:49:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 00:49:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 00:49:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 00:49:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 00:49:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 00:49:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 00:49:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 00:49:47,895 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 00:49:47,898 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 00:49:48,080 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 00:49:48,096 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 00:49:48,096 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 00:49:48,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:49:48 BoogieIcfgContainer [2022-04-08 00:49:48,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 00:49:48,098 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 00:49:48,098 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 00:49:48,104 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 00:49:48,107 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:49:48" (1/1) ... [2022-04-08 00:49:48,113 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 00:49:48,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 12:49:48 BasicIcfg [2022-04-08 00:49:48,168 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 00:49:48,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 00:49:48,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 00:49:48,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 00:49:48,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:49:47" (1/4) ... [2022-04-08 00:49:48,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e6f7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:49:48, skipping insertion in model container [2022-04-08 00:49:48,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:49:47" (2/4) ... [2022-04-08 00:49:48,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e6f7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:49:48, skipping insertion in model container [2022-04-08 00:49:48,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:49:48" (3/4) ... [2022-04-08 00:49:48,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e6f7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:49:48, skipping insertion in model container [2022-04-08 00:49:48,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 12:49:48" (4/4) ... [2022-04-08 00:49:48,177 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound10.cqvasr [2022-04-08 00:49:48,181 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 00:49:48,181 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 00:49:48,217 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 00:49:48,222 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 00:49:48,223 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 00:49:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 00:49:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 00:49:48,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:49:48,245 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:49:48,246 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:49:48,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:49:48,251 INFO L85 PathProgramCache]: Analyzing trace with hash 6304412, now seen corresponding path program 1 times [2022-04-08 00:49:48,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:49:48,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354173184] [2022-04-08 00:49:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:49:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:48,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 00:49:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:48,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {43#true} is VALID [2022-04-08 00:49:48,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-08 00:49:48,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-08 00:49:48,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 00:49:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:48,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-08 00:49:48,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-08 00:49:48,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-08 00:49:48,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-08 00:49:48,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 00:49:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:48,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-08 00:49:48,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-08 00:49:48,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-08 00:49:48,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-08 00:49:48,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 00:49:48,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {43#true} is VALID [2022-04-08 00:49:48,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-08 00:49:48,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-08 00:49:48,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-08 00:49:48,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {43#true} is VALID [2022-04-08 00:49:48,521 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {43#true} is VALID [2022-04-08 00:49:48,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-08 00:49:48,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-08 00:49:48,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-08 00:49:48,526 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-08 00:49:48,526 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {43#true} is VALID [2022-04-08 00:49:48,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-08 00:49:48,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-08 00:49:48,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-08 00:49:48,527 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-08 00:49:48,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44#false} is VALID [2022-04-08 00:49:48,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} [123] L34-3-->L34-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-08 00:49:48,529 INFO L272 TraceCheckUtils]: 18: Hoare triple {44#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44#false} is VALID [2022-04-08 00:49:48,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44#false} is VALID [2022-04-08 00:49:48,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} [134] L11-->L12: 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[] {44#false} is VALID [2022-04-08 00:49:48,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-08 00:49:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 00:49:48,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:49:48,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354173184] [2022-04-08 00:49:48,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354173184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:49:48,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:49:48,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 00:49:48,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024749110] [2022-04-08 00:49:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:49:48,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 00:49:48,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:49:48,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:48,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:49:48,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 00:49:48,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:49:48,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 00:49:48,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 00:49:48,617 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:48,848 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-04-08 00:49:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 00:49:48,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 00:49:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:49:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-08 00:49:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-08 00:49:48,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-08 00:49:49,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:49:49,021 INFO L225 Difference]: With dead ends: 74 [2022-04-08 00:49:49,021 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 00:49:49,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 00:49:49,033 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 00:49:49,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 00:49:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 00:49:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-08 00:49:49,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:49:49,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:49,074 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:49,075 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:49,087 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-08 00:49:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-08 00:49:49,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:49,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:49,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 00:49:49,091 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 00:49:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:49,095 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-08 00:49:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-08 00:49:49,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:49,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:49,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:49:49,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:49:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-08 00:49:49,101 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-08 00:49:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:49:49,101 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-08 00:49:49,102 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-08 00:49:49,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 00:49:49,103 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:49:49,103 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:49:49,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 00:49:49,103 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:49:49,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:49:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1535904754, now seen corresponding path program 1 times [2022-04-08 00:49:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:49:49,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219644374] [2022-04-08 00:49:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:49,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:49:49,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:49:49,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512148062] [2022-04-08 00:49:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:49,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:49:49,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:49:49,126 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 00:49:49,127 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 00:49:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:49,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 00:49:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:49,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:49:49,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {284#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {284#true} is VALID [2022-04-08 00:49:49,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#(<= ~counter~0 0)} {284#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {292#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,367 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,368 INFO L272 TraceCheckUtils]: 11: Hoare triple {292#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {292#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,370 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {292#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {292#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:49,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {292#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {341#(<= |main_#t~post6| 0)} is VALID [2022-04-08 00:49:49,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {341#(<= |main_#t~post6| 0)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {285#false} is VALID [2022-04-08 00:49:49,372 INFO L272 TraceCheckUtils]: 19: Hoare triple {285#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {285#false} is VALID [2022-04-08 00:49:49,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {285#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {285#false} is VALID [2022-04-08 00:49:49,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {285#false} [134] L11-->L12: 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[] {285#false} is VALID [2022-04-08 00:49:49,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {285#false} is VALID [2022-04-08 00:49:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 00:49:49,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:49:49,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:49:49,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219644374] [2022-04-08 00:49:49,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:49:49,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512148062] [2022-04-08 00:49:49,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512148062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:49:49,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:49:49,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 00:49:49,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075867556] [2022-04-08 00:49:49,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:49:49,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 00:49:49,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:49:49,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:49,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:49:49,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 00:49:49,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:49:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 00:49:49,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 00:49:49,396 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:49,481 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-08 00:49:49,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 00:49:49,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 00:49:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:49:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-08 00:49:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-08 00:49:49,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-08 00:49:49,530 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 00:49:49,532 INFO L225 Difference]: With dead ends: 44 [2022-04-08 00:49:49,532 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 00:49:49,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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 00:49:49,534 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:49:49,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:49:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 00:49:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 00:49:49,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:49:49,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:49,544 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:49,545 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:49,547 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-08 00:49:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-08 00:49:49,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:49,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:49,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-08 00:49:49,549 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-08 00:49:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:49,552 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-08 00:49:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-08 00:49:49,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:49,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:49,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:49:49,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:49:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-08 00:49:49,556 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-08 00:49:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:49:49,556 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-08 00:49:49,556 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-08 00:49:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 00:49:49,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:49:49,558 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:49:49,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 00:49:49,771 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 00:49:49,771 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:49:49,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:49:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 401530880, now seen corresponding path program 1 times [2022-04-08 00:49:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:49:49,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223120082] [2022-04-08 00:49:49,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:49,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:49:49,793 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:49:49,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507933268] [2022-04-08 00:49:49,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:49,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:49:49,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:49:49,794 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 00:49:49,818 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 00:49:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:49,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 00:49:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:49,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:49:49,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {547#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-08 00:49:49,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {547#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {547#true} is VALID [2022-04-08 00:49:49,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-08 00:49:49,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {547#true} {547#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-08 00:49:49,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {547#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-08 00:49:49,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {547#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {547#true} is VALID [2022-04-08 00:49:49,990 INFO L272 TraceCheckUtils]: 6: Hoare triple {547#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {547#true} is VALID [2022-04-08 00:49:49,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {547#true} is VALID [2022-04-08 00:49:49,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-08 00:49:49,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {547#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#true} is VALID [2022-04-08 00:49:49,991 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {547#true} {547#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {547#true} is VALID [2022-04-08 00:49:49,991 INFO L272 TraceCheckUtils]: 11: Hoare triple {547#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {547#true} is VALID [2022-04-08 00:49:49,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:49:49,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:49,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:49,994 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {592#(not (= |assume_abort_if_not_#in~cond| 0))} {547#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {599#(<= 1 main_~y~0)} is VALID [2022-04-08 00:49:49,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {599#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {603#(<= 1 main_~b~0)} is VALID [2022-04-08 00:49:49,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {603#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {603#(<= 1 main_~b~0)} is VALID [2022-04-08 00:49:49,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {603#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {603#(<= 1 main_~b~0)} is VALID [2022-04-08 00:49:49,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {548#false} is VALID [2022-04-08 00:49:49,999 INFO L272 TraceCheckUtils]: 20: Hoare triple {548#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {548#false} is VALID [2022-04-08 00:49:49,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {548#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {548#false} is VALID [2022-04-08 00:49:50,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {548#false} [134] L11-->L12: 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[] {548#false} is VALID [2022-04-08 00:49:50,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {548#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {548#false} is VALID [2022-04-08 00:49:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 00:49:50,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:49:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:49:50,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223120082] [2022-04-08 00:49:50,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:49:50,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507933268] [2022-04-08 00:49:50,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507933268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:49:50,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:49:50,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 00:49:50,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960120599] [2022-04-08 00:49:50,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:49:50,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-08 00:49:50,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:49:50,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:49:50,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:49:50,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 00:49:50,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:49:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 00:49:50,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 00:49:50,035 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:49:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:50,358 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-08 00:49:50,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 00:49:50,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-08 00:49:50,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:49:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:49:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 00:49:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:49:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 00:49:50,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-08 00:49:50,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:49:50,466 INFO L225 Difference]: With dead ends: 57 [2022-04-08 00:49:50,466 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 00:49:50,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 00:49:50,468 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 00:49:50,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 00:49:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 00:49:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-04-08 00:49:50,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:49:50,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:50,485 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:50,485 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:50,488 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-08 00:49:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-08 00:49:50,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:50,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:50,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-08 00:49:50,490 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-08 00:49:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:50,492 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-08 00:49:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-08 00:49:50,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:50,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:50,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:49:50,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:49:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-04-08 00:49:50,496 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24 [2022-04-08 00:49:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:49:50,496 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-04-08 00:49:50,497 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:49:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 00:49:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 00:49:50,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:49:50,497 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:49:50,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 00:49:50,703 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 00:49:50,704 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:49:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:49:50,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2110136122, now seen corresponding path program 1 times [2022-04-08 00:49:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:49:50,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667876554] [2022-04-08 00:49:50,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:49:50,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:49:50,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [430368544] [2022-04-08 00:49:50,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:50,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:49:50,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:49:50,724 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 00:49:50,732 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 00:49:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:50,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 00:49:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:50,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:49:50,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {865#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {865#true} is VALID [2022-04-08 00:49:50,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {865#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#(<= ~counter~0 0)} {865#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {873#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,959 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,959 INFO L272 TraceCheckUtils]: 11: Hoare triple {873#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,961 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {873#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:50,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {873#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {922#(<= ~counter~0 1)} is VALID [2022-04-08 00:49:50,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {922#(<= ~counter~0 1)} is VALID [2022-04-08 00:49:50,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {922#(<= ~counter~0 1)} is VALID [2022-04-08 00:49:50,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {932#(<= |main_#t~post7| 1)} is VALID [2022-04-08 00:49:50,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {932#(<= |main_#t~post7| 1)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {866#false} is VALID [2022-04-08 00:49:50,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {866#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {866#false} is VALID [2022-04-08 00:49:50,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {866#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {866#false} is VALID [2022-04-08 00:49:50,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {866#false} is VALID [2022-04-08 00:49:50,965 INFO L272 TraceCheckUtils]: 25: Hoare triple {866#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {866#false} is VALID [2022-04-08 00:49:50,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {866#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {866#false} is VALID [2022-04-08 00:49:50,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {866#false} [134] L11-->L12: 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[] {866#false} is VALID [2022-04-08 00:49:50,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {866#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {866#false} is VALID [2022-04-08 00:49:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 00:49:50,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:49:50,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:49:50,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667876554] [2022-04-08 00:49:50,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:49:50,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430368544] [2022-04-08 00:49:50,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430368544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:49:50,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:49:50,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 00:49:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928197821] [2022-04-08 00:49:50,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:49:50,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-08 00:49:50,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:49:50,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:50,988 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 00:49:50,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 00:49:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:49:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 00:49:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 00:49:50,989 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:51,118 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-04-08 00:49:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 00:49:51,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-08 00:49:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:49:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-08 00:49:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-08 00:49:51,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-08 00:49:51,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:49:51,185 INFO L225 Difference]: With dead ends: 62 [2022-04-08 00:49:51,185 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 00:49:51,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 00:49:51,189 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:49:51,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:49:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 00:49:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-08 00:49:51,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:49:51,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:51,218 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:51,218 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:51,225 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 00:49:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-08 00:49:51,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:51,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:51,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-08 00:49:51,231 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-08 00:49:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:51,235 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 00:49:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-08 00:49:51,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:51,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:51,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:49:51,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:49:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 00:49:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-04-08 00:49:51,241 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2022-04-08 00:49:51,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:49:51,242 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-04-08 00:49:51,242 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-08 00:49:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 00:49:51,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:49:51,244 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:49:51,274 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 00:49:51,464 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 00:49:51,464 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:49:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:49:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash -358604865, now seen corresponding path program 1 times [2022-04-08 00:49:51,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:49:51,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858220663] [2022-04-08 00:49:51,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:51,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:49:51,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:49:51,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566799338] [2022-04-08 00:49:51,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:51,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:49:51,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:49:51,677 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 00:49:51,696 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 00:49:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:51,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 00:49:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:51,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:49:52,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1183#true} is VALID [2022-04-08 00:49:52,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {1183#true} is VALID [2022-04-08 00:49:52,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1183#true} is VALID [2022-04-08 00:49:52,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1183#true} is VALID [2022-04-08 00:49:52,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1183#true} is VALID [2022-04-08 00:49:52,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1183#true} is VALID [2022-04-08 00:49:52,111 INFO L272 TraceCheckUtils]: 6: Hoare triple {1183#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1183#true} is VALID [2022-04-08 00:49:52,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1183#true} is VALID [2022-04-08 00:49:52,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1183#true} is VALID [2022-04-08 00:49:52,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1183#true} is VALID [2022-04-08 00:49:52,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1183#true} {1183#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1183#true} is VALID [2022-04-08 00:49:52,112 INFO L272 TraceCheckUtils]: 11: Hoare triple {1183#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1183#true} is VALID [2022-04-08 00:49:52,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:49:52,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:52,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {1228#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:52,121 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1228#(not (= |assume_abort_if_not_#in~cond| 0))} {1183#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1235#(<= 1 main_~y~0)} is VALID [2022-04-08 00:49:52,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:49:52,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:49:52,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:49:52,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:49:52,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:49:52,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:49:52,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:49:52,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:49:52,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:49:52,128 INFO L272 TraceCheckUtils]: 25: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:49:52,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:49:52,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {1273#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {1184#false} is VALID [2022-04-08 00:49:52,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {1184#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1184#false} is VALID [2022-04-08 00:49:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 00:49:52,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:49:52,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:49:52,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858220663] [2022-04-08 00:49:52,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:49:52,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566799338] [2022-04-08 00:49:52,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566799338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:49:52,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:49:52,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 00:49:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002667353] [2022-04-08 00:49:52,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:49:52,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-08 00:49:52,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:49:52,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:49:52,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:49:52,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 00:49:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:49:52,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 00:49:52,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-08 00:49:52,155 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:49:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:52,853 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-04-08 00:49:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 00:49:52,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-08 00:49:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:49:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:49:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-08 00:49:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:49:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-08 00:49:52,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-04-08 00:49:52,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:49:52,934 INFO L225 Difference]: With dead ends: 68 [2022-04-08 00:49:52,934 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 00:49:52,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-08 00:49:52,936 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 00:49:52,936 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 237 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 00:49:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 00:49:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-04-08 00:49:52,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:49:52,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 00:49:52,977 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 00:49:52,977 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 00:49:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:52,982 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-08 00:49:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-08 00:49:52,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:52,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:52,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-08 00:49:52,984 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-08 00:49:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:52,988 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-08 00:49:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-08 00:49:52,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:52,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:52,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:49:52,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:49:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 00:49:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-08 00:49:52,992 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-08 00:49:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:49:52,993 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-08 00:49:52,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:49:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-08 00:49:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 00:49:52,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:49:52,995 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:49:53,019 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 00:49:53,211 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 00:49:53,211 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:49:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:49:53,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2061673945, now seen corresponding path program 1 times [2022-04-08 00:49:53,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:49:53,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804700836] [2022-04-08 00:49:53,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:53,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:49:53,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:49:53,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404756959] [2022-04-08 00:49:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:53,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:49:53,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:49:53,231 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 00:49:53,242 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 00:49:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:53,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 00:49:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:53,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:49:53,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {1597#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1597#true} is VALID [2022-04-08 00:49:53,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1597#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1605#(<= ~counter~0 0)} {1597#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {1605#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,484 INFO L272 TraceCheckUtils]: 6: Hoare triple {1605#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {1605#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {1605#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {1605#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,486 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1605#(<= ~counter~0 0)} {1605#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,486 INFO L272 TraceCheckUtils]: 11: Hoare triple {1605#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {1605#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {1605#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,488 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1605#(<= ~counter~0 0)} {1605#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1605#(<= ~counter~0 0)} is VALID [2022-04-08 00:49:53,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {1605#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1654#(<= ~counter~0 1)} is VALID [2022-04-08 00:49:53,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1654#(<= ~counter~0 1)} is VALID [2022-04-08 00:49:53,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {1654#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1654#(<= ~counter~0 1)} is VALID [2022-04-08 00:49:53,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1664#(<= ~counter~0 2)} is VALID [2022-04-08 00:49:53,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1664#(<= ~counter~0 2)} is VALID [2022-04-08 00:49:53,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {1664#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {1664#(<= ~counter~0 2)} is VALID [2022-04-08 00:49:53,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {1664#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1664#(<= ~counter~0 2)} is VALID [2022-04-08 00:49:53,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {1664#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1677#(<= |main_#t~post6| 2)} is VALID [2022-04-08 00:49:53,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#(<= |main_#t~post6| 2)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1598#false} is VALID [2022-04-08 00:49:53,492 INFO L272 TraceCheckUtils]: 26: Hoare triple {1598#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1598#false} is VALID [2022-04-08 00:49:53,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {1598#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1598#false} is VALID [2022-04-08 00:49:53,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {1598#false} [134] L11-->L12: 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[] {1598#false} is VALID [2022-04-08 00:49:53,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {1598#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1598#false} is VALID [2022-04-08 00:49:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 00:49:53,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:49:53,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {1598#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1598#false} is VALID [2022-04-08 00:49:53,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {1598#false} [134] L11-->L12: 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[] {1598#false} is VALID [2022-04-08 00:49:53,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {1598#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1598#false} is VALID [2022-04-08 00:49:53,719 INFO L272 TraceCheckUtils]: 26: Hoare triple {1598#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1598#false} is VALID [2022-04-08 00:49:53,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {1705#(< |main_#t~post6| 10)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1598#false} is VALID [2022-04-08 00:49:53,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {1709#(< ~counter~0 10)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1705#(< |main_#t~post6| 10)} is VALID [2022-04-08 00:49:53,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {1709#(< ~counter~0 10)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1709#(< ~counter~0 10)} is VALID [2022-04-08 00:49:53,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {1709#(< ~counter~0 10)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {1709#(< ~counter~0 10)} is VALID [2022-04-08 00:49:53,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {1709#(< ~counter~0 10)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1709#(< ~counter~0 10)} is VALID [2022-04-08 00:49:53,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {1722#(< ~counter~0 9)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1709#(< ~counter~0 10)} is VALID [2022-04-08 00:49:53,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {1722#(< ~counter~0 9)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1722#(< ~counter~0 9)} is VALID [2022-04-08 00:49:53,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {1722#(< ~counter~0 9)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1722#(< ~counter~0 9)} is VALID [2022-04-08 00:49:53,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {1732#(< ~counter~0 8)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1722#(< ~counter~0 9)} is VALID [2022-04-08 00:49:53,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {1732#(< ~counter~0 8)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1732#(< ~counter~0 8)} is VALID [2022-04-08 00:49:53,728 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1597#true} {1732#(< ~counter~0 8)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1732#(< ~counter~0 8)} is VALID [2022-04-08 00:49:53,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {1597#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1597#true} is VALID [2022-04-08 00:49:53,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {1597#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1597#true} is VALID [2022-04-08 00:49:53,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {1597#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1597#true} is VALID [2022-04-08 00:49:53,728 INFO L272 TraceCheckUtils]: 11: Hoare triple {1732#(< ~counter~0 8)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1597#true} is VALID [2022-04-08 00:49:53,729 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1597#true} {1732#(< ~counter~0 8)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1732#(< ~counter~0 8)} is VALID [2022-04-08 00:49:53,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {1597#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1597#true} is VALID [2022-04-08 00:49:53,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {1597#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1597#true} is VALID [2022-04-08 00:49:53,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {1597#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1597#true} is VALID [2022-04-08 00:49:53,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {1732#(< ~counter~0 8)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1597#true} is VALID [2022-04-08 00:49:53,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {1732#(< ~counter~0 8)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1732#(< ~counter~0 8)} is VALID [2022-04-08 00:49:53,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {1732#(< ~counter~0 8)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#(< ~counter~0 8)} is VALID [2022-04-08 00:49:53,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1732#(< ~counter~0 8)} {1597#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#(< ~counter~0 8)} is VALID [2022-04-08 00:49:53,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {1732#(< ~counter~0 8)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1732#(< ~counter~0 8)} is VALID [2022-04-08 00:49:53,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {1597#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {1732#(< ~counter~0 8)} is VALID [2022-04-08 00:49:53,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {1597#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1597#true} is VALID [2022-04-08 00:49:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 00:49:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:49:53,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804700836] [2022-04-08 00:49:53,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:49:53,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404756959] [2022-04-08 00:49:53,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404756959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:49:53,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:49:53,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 00:49:53,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286357358] [2022-04-08 00:49:53,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:49:53,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-08 00:49:53,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:49:53,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:49:53,766 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 00:49:53,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 00:49:53,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:49:53,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 00:49:53,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 00:49:53,767 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:49:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:54,310 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2022-04-08 00:49:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 00:49:54,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-08 00:49:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:49:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:49:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-04-08 00:49:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:49:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-04-08 00:49:54,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 145 transitions. [2022-04-08 00:49:54,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:49:54,437 INFO L225 Difference]: With dead ends: 151 [2022-04-08 00:49:54,437 INFO L226 Difference]: Without dead ends: 144 [2022-04-08 00:49:54,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-04-08 00:49:54,438 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 132 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 00:49:54,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 257 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 00:49:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-08 00:49:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2022-04-08 00:49:54,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:49:54,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 00:49:54,526 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 00:49:54,527 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 00:49:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:54,533 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-04-08 00:49:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2022-04-08 00:49:54,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:54,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:54,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 144 states. [2022-04-08 00:49:54,534 INFO L87 Difference]: Start difference. First operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 144 states. [2022-04-08 00:49:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:54,540 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-04-08 00:49:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2022-04-08 00:49:54,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:54,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:54,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:49:54,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:49:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 00:49:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2022-04-08 00:49:54,545 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 30 [2022-04-08 00:49:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:49:54,545 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2022-04-08 00:49:54,545 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:49:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2022-04-08 00:49:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 00:49:54,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:49:54,546 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:49:54,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 00:49:54,755 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 00:49:54,755 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:49:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:49:54,756 INFO L85 PathProgramCache]: Analyzing trace with hash 545740907, now seen corresponding path program 1 times [2022-04-08 00:49:54,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:49:54,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616885659] [2022-04-08 00:49:54,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:49:54,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:49:54,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459789639] [2022-04-08 00:49:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:54,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:49:54,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:49:54,773 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 00:49:54,791 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 00:49:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:54,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 00:49:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:54,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:49:54,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {2441#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:54,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {2441#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {2441#true} is VALID [2022-04-08 00:49:54,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {2441#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:54,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2441#true} {2441#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:54,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {2441#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:54,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {2441#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2441#true} is VALID [2022-04-08 00:49:54,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {2441#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2441#true} is VALID [2022-04-08 00:49:55,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {2441#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2467#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:49:55,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {2467#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:55,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:55,005 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} {2441#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2478#(<= 1 main_~x~0)} is VALID [2022-04-08 00:49:55,005 INFO L272 TraceCheckUtils]: 11: Hoare triple {2478#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2441#true} is VALID [2022-04-08 00:49:55,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {2441#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2441#true} is VALID [2022-04-08 00:49:55,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {2441#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:55,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {2441#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:55,006 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2441#true} {2478#(<= 1 main_~x~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2478#(<= 1 main_~x~0)} is VALID [2022-04-08 00:49:55,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {2478#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2497#(<= 1 main_~a~0)} is VALID [2022-04-08 00:49:55,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {2497#(<= 1 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2497#(<= 1 main_~a~0)} is VALID [2022-04-08 00:49:55,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {2497#(<= 1 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2497#(<= 1 main_~a~0)} is VALID [2022-04-08 00:49:55,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {2497#(<= 1 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2507#(<= 1 main_~c~0)} is VALID [2022-04-08 00:49:55,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {2507#(<= 1 main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2507#(<= 1 main_~c~0)} is VALID [2022-04-08 00:49:55,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {2507#(<= 1 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2507#(<= 1 main_~c~0)} is VALID [2022-04-08 00:49:55,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {2507#(<= 1 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {2507#(<= 1 main_~c~0)} is VALID [2022-04-08 00:49:55,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {2507#(<= 1 main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2520#(<= 1 main_~b~0)} is VALID [2022-04-08 00:49:55,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {2520#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2520#(<= 1 main_~b~0)} is VALID [2022-04-08 00:49:55,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {2520#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2520#(<= 1 main_~b~0)} is VALID [2022-04-08 00:49:55,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {2520#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {2442#false} is VALID [2022-04-08 00:49:55,011 INFO L272 TraceCheckUtils]: 27: Hoare triple {2442#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2442#false} is VALID [2022-04-08 00:49:55,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {2442#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2442#false} is VALID [2022-04-08 00:49:55,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {2442#false} [134] L11-->L12: 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[] {2442#false} is VALID [2022-04-08 00:49:55,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {2442#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2442#false} is VALID [2022-04-08 00:49:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 00:49:55,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:49:55,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {2442#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2442#false} is VALID [2022-04-08 00:49:55,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {2442#false} [134] L11-->L12: 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[] {2442#false} is VALID [2022-04-08 00:49:55,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {2442#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2442#false} is VALID [2022-04-08 00:49:55,254 INFO L272 TraceCheckUtils]: 27: Hoare triple {2442#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2442#false} is VALID [2022-04-08 00:49:55,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {2520#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {2442#false} is VALID [2022-04-08 00:49:55,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {2520#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2520#(<= 1 main_~b~0)} is VALID [2022-04-08 00:49:55,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {2520#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2520#(<= 1 main_~b~0)} is VALID [2022-04-08 00:49:55,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {2507#(<= 1 main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2520#(<= 1 main_~b~0)} is VALID [2022-04-08 00:49:55,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {2507#(<= 1 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {2507#(<= 1 main_~c~0)} is VALID [2022-04-08 00:49:55,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {2507#(<= 1 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2507#(<= 1 main_~c~0)} is VALID [2022-04-08 00:49:55,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {2507#(<= 1 main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2507#(<= 1 main_~c~0)} is VALID [2022-04-08 00:49:55,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {2497#(<= 1 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2507#(<= 1 main_~c~0)} is VALID [2022-04-08 00:49:55,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {2497#(<= 1 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2497#(<= 1 main_~a~0)} is VALID [2022-04-08 00:49:55,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {2497#(<= 1 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2497#(<= 1 main_~a~0)} is VALID [2022-04-08 00:49:55,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {2478#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2497#(<= 1 main_~a~0)} is VALID [2022-04-08 00:49:55,260 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2441#true} {2478#(<= 1 main_~x~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2478#(<= 1 main_~x~0)} is VALID [2022-04-08 00:49:55,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {2441#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:55,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {2441#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:55,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {2441#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2441#true} is VALID [2022-04-08 00:49:55,260 INFO L272 TraceCheckUtils]: 11: Hoare triple {2478#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2441#true} is VALID [2022-04-08 00:49:55,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} {2441#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2478#(<= 1 main_~x~0)} is VALID [2022-04-08 00:49:55,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:55,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {2611#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:55,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {2441#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2611#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 00:49:55,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {2441#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2441#true} is VALID [2022-04-08 00:49:55,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {2441#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2441#true} is VALID [2022-04-08 00:49:55,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {2441#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:55,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2441#true} {2441#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:55,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {2441#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:55,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {2441#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {2441#true} is VALID [2022-04-08 00:49:55,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {2441#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2441#true} is VALID [2022-04-08 00:49:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 00:49:55,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:49:55,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616885659] [2022-04-08 00:49:55,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:49:55,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459789639] [2022-04-08 00:49:55,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459789639] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:49:55,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:49:55,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 00:49:55,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345792071] [2022-04-08 00:49:55,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:49:55,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-08 00:49:55,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:49:55,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:55,290 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 00:49:55,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 00:49:55,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:49:55,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 00:49:55,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 00:49:55,291 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:56,241 INFO L93 Difference]: Finished difference Result 187 states and 265 transitions. [2022-04-08 00:49:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 00:49:56,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-08 00:49:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:49:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-08 00:49:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-08 00:49:56,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-04-08 00:49:56,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:49:56,404 INFO L225 Difference]: With dead ends: 187 [2022-04-08 00:49:56,404 INFO L226 Difference]: Without dead ends: 175 [2022-04-08 00:49:56,405 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-08 00:49:56,405 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 113 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 00:49:56,405 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 358 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 00:49:56,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-08 00:49:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-04-08 00:49:56,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:49:56,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:49:56,588 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:49:56,588 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:49:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:56,596 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-04-08 00:49:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2022-04-08 00:49:56,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:56,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:56,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 175 states. [2022-04-08 00:49:56,598 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 175 states. [2022-04-08 00:49:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:56,605 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-04-08 00:49:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2022-04-08 00:49:56,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:56,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:56,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:49:56,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:49:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:49:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2022-04-08 00:49:56,612 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 31 [2022-04-08 00:49:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:49:56,612 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2022-04-08 00:49:56,612 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:49:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2022-04-08 00:49:56,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 00:49:56,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:49:56,613 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:49:56,639 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 00:49:56,838 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 00:49:56,838 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:49:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:49:56,839 INFO L85 PathProgramCache]: Analyzing trace with hash 653912885, now seen corresponding path program 1 times [2022-04-08 00:49:56,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:49:56,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610227510] [2022-04-08 00:49:56,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:56,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:49:56,868 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:49:56,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649487215] [2022-04-08 00:49:56,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:56,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:49:56,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:49:56,879 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 00:49:56,907 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 00:49:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:56,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 00:49:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:56,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:49:57,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {3457#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3457#true} is VALID [2022-04-08 00:49:57,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {3457#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {3457#true} is VALID [2022-04-08 00:49:57,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {3457#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3457#true} is VALID [2022-04-08 00:49:57,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3457#true} {3457#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3457#true} is VALID [2022-04-08 00:49:57,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {3457#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3457#true} is VALID [2022-04-08 00:49:57,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {3457#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3457#true} is VALID [2022-04-08 00:49:57,367 INFO L272 TraceCheckUtils]: 6: Hoare triple {3457#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3457#true} is VALID [2022-04-08 00:49:57,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {3457#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3457#true} is VALID [2022-04-08 00:49:57,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {3457#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3457#true} is VALID [2022-04-08 00:49:57,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {3457#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3457#true} is VALID [2022-04-08 00:49:57,368 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3457#true} {3457#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {3457#true} is VALID [2022-04-08 00:49:57,368 INFO L272 TraceCheckUtils]: 11: Hoare triple {3457#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3457#true} is VALID [2022-04-08 00:49:57,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {3457#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3498#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:49:57,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {3498#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3502#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:57,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {3502#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3502#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:57,375 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3502#(not (= |assume_abort_if_not_#in~cond| 0))} {3457#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {3509#(<= 1 main_~y~0)} is VALID [2022-04-08 00:49:57,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {3509#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 00:49:57,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 00:49:57,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 00:49:57,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 00:49:57,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 00:49:57,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 00:49:57,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 00:49:57,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 00:49:57,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 00:49:57,381 INFO L272 TraceCheckUtils]: 25: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3457#true} is VALID [2022-04-08 00:49:57,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {3457#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3457#true} is VALID [2022-04-08 00:49:57,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {3457#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3457#true} is VALID [2022-04-08 00:49:57,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {3457#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3457#true} is VALID [2022-04-08 00:49:57,382 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3457#true} {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 00:49:57,383 INFO L272 TraceCheckUtils]: 30: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3558#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:49:57,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {3558#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3562#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:49:57,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {3562#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {3458#false} is VALID [2022-04-08 00:49:57,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {3458#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3458#false} is VALID [2022-04-08 00:49:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 00:49:57,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:49:57,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:49:57,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610227510] [2022-04-08 00:49:57,387 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:49:57,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649487215] [2022-04-08 00:49:57,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649487215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:49:57,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:49:57,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 00:49:57,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486597606] [2022-04-08 00:49:57,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:49:57,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-08 00:49:57,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:49:57,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 00:49:57,420 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 00:49:57,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 00:49:57,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:49:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 00:49:57,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-08 00:49:57,422 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 00:49:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:58,275 INFO L93 Difference]: Finished difference Result 157 states and 210 transitions. [2022-04-08 00:49:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 00:49:58,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-08 00:49:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:49:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 00:49:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-08 00:49:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 00:49:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-08 00:49:58,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 93 transitions. [2022-04-08 00:49:58,369 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 00:49:58,372 INFO L225 Difference]: With dead ends: 157 [2022-04-08 00:49:58,372 INFO L226 Difference]: Without dead ends: 155 [2022-04-08 00:49:58,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-08 00:49:58,373 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 00:49:58,373 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 241 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 00:49:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-08 00:49:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2022-04-08 00:49:58,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:49:58,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:49:58,569 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:49:58,569 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:49:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:58,574 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-04-08 00:49:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2022-04-08 00:49:58,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:58,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:58,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 155 states. [2022-04-08 00:49:58,577 INFO L87 Difference]: Start difference. First operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 155 states. [2022-04-08 00:49:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:49:58,581 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-04-08 00:49:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2022-04-08 00:49:58,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:49:58,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:49:58,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:49:58,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:49:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 00:49:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2022-04-08 00:49:58,588 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 34 [2022-04-08 00:49:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:49:58,589 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2022-04-08 00:49:58,589 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 00:49:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2022-04-08 00:49:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 00:49:58,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:49:58,591 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:49:58,619 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 00:49:58,804 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 00:49:58,804 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:49:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:49:58,805 INFO L85 PathProgramCache]: Analyzing trace with hash -47631820, now seen corresponding path program 1 times [2022-04-08 00:49:58,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:49:58,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603336200] [2022-04-08 00:49:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:49:58,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:49:58,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63672398] [2022-04-08 00:49:58,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:49:58,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:49:58,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:49:58,831 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 00:49:58,834 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 00:49:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:58,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 00:49:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:49:58,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:49:59,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {4310#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {4310#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {4310#true} is VALID [2022-04-08 00:49:59,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {4310#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4310#true} {4310#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {4310#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {4310#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4310#true} is VALID [2022-04-08 00:49:59,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {4310#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4310#true} is VALID [2022-04-08 00:49:59,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {4310#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4336#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:49:59,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {4336#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4340#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:59,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {4340#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4340#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:49:59,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4340#(not (= |assume_abort_if_not_#in~cond| 0))} {4310#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4347#(<= 1 main_~x~0)} is VALID [2022-04-08 00:49:59,218 INFO L272 TraceCheckUtils]: 11: Hoare triple {4347#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4310#true} is VALID [2022-04-08 00:49:59,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {4310#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4310#true} is VALID [2022-04-08 00:49:59,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {4310#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {4310#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,218 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4310#true} {4347#(<= 1 main_~x~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4347#(<= 1 main_~x~0)} is VALID [2022-04-08 00:49:59,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {4347#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 00:49:59,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 00:49:59,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 00:49:59,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 00:49:59,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 00:49:59,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 00:49:59,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 00:49:59,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:49:59,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:49:59,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:49:59,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:49:59,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:49:59,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:49:59,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:49:59,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:49:59,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:49:59,230 INFO L272 TraceCheckUtils]: 32: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:49:59,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:49:59,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {4420#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {4311#false} is VALID [2022-04-08 00:49:59,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {4311#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4311#false} is VALID [2022-04-08 00:49:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 00:49:59,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:49:59,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {4311#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4311#false} is VALID [2022-04-08 00:49:59,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {4420#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {4311#false} is VALID [2022-04-08 00:49:59,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:49:59,455 INFO L272 TraceCheckUtils]: 32: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:49:59,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:49:59,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:49:59,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:49:59,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:49:59,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:49:59,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:49:59,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:49:59,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:49:59,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:49:59,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:49:59,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:49:59,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:49:59,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:49:59,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:49:59,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:49:59,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {4310#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:49:59,461 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4310#true} {4310#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4310#true} is VALID [2022-04-08 00:49:59,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {4310#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {4310#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {4310#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4310#true} is VALID [2022-04-08 00:49:59,462 INFO L272 TraceCheckUtils]: 11: Hoare triple {4310#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {4310#true} is VALID [2022-04-08 00:49:59,462 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4310#true} {4310#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4310#true} is VALID [2022-04-08 00:49:59,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {4310#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {4310#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {4310#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {4310#true} is VALID [2022-04-08 00:49:59,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {4310#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {4310#true} is VALID [2022-04-08 00:49:59,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {4310#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4310#true} is VALID [2022-04-08 00:49:59,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {4310#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4310#true} {4310#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {4310#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {4310#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {4310#true} is VALID [2022-04-08 00:49:59,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {4310#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4310#true} is VALID [2022-04-08 00:49:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 00:49:59,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:49:59,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603336200] [2022-04-08 00:49:59,464 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:49:59,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63672398] [2022-04-08 00:49:59,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63672398] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:49:59,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:49:59,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-08 00:49:59,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807564638] [2022-04-08 00:49:59,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:49:59,465 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-08 00:49:59,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:49:59,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:49:59,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:49:59,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 00:49:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:49:59,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 00:49:59,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-08 00:49:59,505 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:50:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:00,410 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2022-04-08 00:50:00,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 00:50:00,410 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-08 00:50:00,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:50:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:50:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-08 00:50:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:50:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-08 00:50:00,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-08 00:50:00,498 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 00:50:00,502 INFO L225 Difference]: With dead ends: 179 [2022-04-08 00:50:00,502 INFO L226 Difference]: Without dead ends: 177 [2022-04-08 00:50:00,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-08 00:50:00,504 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 00:50:00,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 336 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 00:50:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-08 00:50:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2022-04-08 00:50:00,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:50:00,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 00:50:00,708 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 00:50:00,708 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 00:50:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:00,714 INFO L93 Difference]: Finished difference Result 177 states and 239 transitions. [2022-04-08 00:50:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2022-04-08 00:50:00,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:00,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:00,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 177 states. [2022-04-08 00:50:00,716 INFO L87 Difference]: Start difference. First operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 177 states. [2022-04-08 00:50:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:00,721 INFO L93 Difference]: Finished difference Result 177 states and 239 transitions. [2022-04-08 00:50:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2022-04-08 00:50:00,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:00,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:00,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:50:00,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:50:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 00:50:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 236 transitions. [2022-04-08 00:50:00,727 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 236 transitions. Word has length 36 [2022-04-08 00:50:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:50:00,727 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 236 transitions. [2022-04-08 00:50:00,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:50:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 236 transitions. [2022-04-08 00:50:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 00:50:00,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:50:00,728 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:50:00,748 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 00:50:00,939 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 00:50:00,940 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:50:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:50:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash -375710268, now seen corresponding path program 1 times [2022-04-08 00:50:00,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:50:00,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944774066] [2022-04-08 00:50:00,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:00,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:50:00,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:50:00,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [829905459] [2022-04-08 00:50:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:00,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:50:00,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:50:00,961 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 00:50:00,963 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 00:50:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:01,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 00:50:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:01,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:50:01,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {5394#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5394#true} is VALID [2022-04-08 00:50:01,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {5394#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {5402#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5402#(<= ~counter~0 0)} {5394#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {5402#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {5402#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,184 INFO L272 TraceCheckUtils]: 6: Hoare triple {5402#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {5402#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {5402#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {5402#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5402#(<= ~counter~0 0)} {5402#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,187 INFO L272 TraceCheckUtils]: 11: Hoare triple {5402#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {5402#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {5402#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {5402#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,188 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5402#(<= ~counter~0 0)} {5402#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {5402#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5402#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:01,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {5402#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {5451#(<= ~counter~0 1)} is VALID [2022-04-08 00:50:01,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {5451#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5451#(<= ~counter~0 1)} is VALID [2022-04-08 00:50:01,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {5451#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {5451#(<= ~counter~0 1)} is VALID [2022-04-08 00:50:01,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {5451#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {5461#(<= ~counter~0 2)} is VALID [2022-04-08 00:50:01,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {5461#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5461#(<= ~counter~0 2)} is VALID [2022-04-08 00:50:01,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {5461#(<= ~counter~0 2)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {5461#(<= ~counter~0 2)} is VALID [2022-04-08 00:50:01,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {5461#(<= ~counter~0 2)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {5471#(<= |main_#t~post8| 2)} is VALID [2022-04-08 00:50:01,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {5471#(<= |main_#t~post8| 2)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {5395#false} is VALID [2022-04-08 00:50:01,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {5395#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {5395#false} is VALID [2022-04-08 00:50:01,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {5395#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {5395#false} is VALID [2022-04-08 00:50:01,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {5395#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5395#false} is VALID [2022-04-08 00:50:01,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {5395#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5395#false} is VALID [2022-04-08 00:50:01,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {5395#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {5395#false} is VALID [2022-04-08 00:50:01,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {5395#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5395#false} is VALID [2022-04-08 00:50:01,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {5395#false} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {5395#false} is VALID [2022-04-08 00:50:01,194 INFO L272 TraceCheckUtils]: 32: Hoare triple {5395#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5395#false} is VALID [2022-04-08 00:50:01,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {5395#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5395#false} is VALID [2022-04-08 00:50:01,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {5395#false} [134] L11-->L12: 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[] {5395#false} is VALID [2022-04-08 00:50:01,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {5395#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5395#false} is VALID [2022-04-08 00:50:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 00:50:01,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:50:01,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:50:01,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944774066] [2022-04-08 00:50:01,195 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:50:01,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829905459] [2022-04-08 00:50:01,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829905459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:50:01,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:50:01,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 00:50:01,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664381204] [2022-04-08 00:50:01,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:50:01,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-08 00:50:01,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:50:01,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:50:01,226 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 00:50:01,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 00:50:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:50:01,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 00:50:01,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 00:50:01,227 INFO L87 Difference]: Start difference. First operand 174 states and 236 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:50:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:01,551 INFO L93 Difference]: Finished difference Result 241 states and 329 transitions. [2022-04-08 00:50:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 00:50:01,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-08 00:50:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:50:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:50:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-08 00:50:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:50:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-08 00:50:01,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2022-04-08 00:50:01,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 00:50:01,621 INFO L225 Difference]: With dead ends: 241 [2022-04-08 00:50:01,622 INFO L226 Difference]: Without dead ends: 174 [2022-04-08 00:50:01,622 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 00:50:01,623 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:50:01,623 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 139 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:50:01,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-08 00:50:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-04-08 00:50:01,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:50:01,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 00:50:01,838 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 00:50:01,838 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 00:50:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:01,842 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-08 00:50:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-08 00:50:01,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:01,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:01,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 174 states. [2022-04-08 00:50:01,844 INFO L87 Difference]: Start difference. First operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 174 states. [2022-04-08 00:50:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:01,849 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-08 00:50:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-08 00:50:01,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:01,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:01,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:50:01,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:50:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-08 00:50:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-04-08 00:50:01,855 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 36 [2022-04-08 00:50:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:50:01,855 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-04-08 00:50:01,855 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 00:50:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-08 00:50:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 00:50:01,856 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:50:01,856 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:50:01,882 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 00:50:02,075 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 00:50:02,076 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:50:02,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:50:02,076 INFO L85 PathProgramCache]: Analyzing trace with hash -344890017, now seen corresponding path program 1 times [2022-04-08 00:50:02,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:50:02,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405883777] [2022-04-08 00:50:02,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:02,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:50:02,092 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:50:02,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573048156] [2022-04-08 00:50:02,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:02,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:50:02,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:50:02,093 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 00:50:02,111 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 00:50:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:02,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 00:50:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:02,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:50:02,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {6441#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {6441#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {6441#true} is VALID [2022-04-08 00:50:02,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {6441#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6441#true} {6441#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {6441#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {6441#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6441#true} is VALID [2022-04-08 00:50:02,275 INFO L272 TraceCheckUtils]: 6: Hoare triple {6441#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6441#true} is VALID [2022-04-08 00:50:02,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {6441#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6441#true} is VALID [2022-04-08 00:50:02,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {6441#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {6441#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,276 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6441#true} {6441#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {6441#true} is VALID [2022-04-08 00:50:02,276 INFO L272 TraceCheckUtils]: 11: Hoare triple {6441#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6441#true} is VALID [2022-04-08 00:50:02,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {6441#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {6441#true} is VALID [2022-04-08 00:50:02,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {6441#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {6441#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,277 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6441#true} {6441#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {6441#true} is VALID [2022-04-08 00:50:02,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {6441#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6441#true} is VALID [2022-04-08 00:50:02,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {6441#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {6441#true} is VALID [2022-04-08 00:50:02,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {6441#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6441#true} is VALID [2022-04-08 00:50:02,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {6441#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 00:50:02,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 00:50:02,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 00:50:02,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 00:50:02,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 00:50:02,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 00:50:02,280 INFO L272 TraceCheckUtils]: 25: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6441#true} is VALID [2022-04-08 00:50:02,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {6441#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6441#true} is VALID [2022-04-08 00:50:02,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {6441#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {6441#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,281 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6441#true} {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 00:50:02,281 INFO L272 TraceCheckUtils]: 30: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6441#true} is VALID [2022-04-08 00:50:02,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {6441#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6441#true} is VALID [2022-04-08 00:50:02,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {6441#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {6441#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6441#true} is VALID [2022-04-08 00:50:02,282 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6441#true} {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 00:50:02,282 INFO L272 TraceCheckUtils]: 35: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {6552#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:50:02,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {6552#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6556#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:50:02,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {6556#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {6442#false} is VALID [2022-04-08 00:50:02,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {6442#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6442#false} is VALID [2022-04-08 00:50:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 00:50:02,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:50:02,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:50:02,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405883777] [2022-04-08 00:50:02,284 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:50:02,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573048156] [2022-04-08 00:50:02,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573048156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:50:02,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:50:02,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 00:50:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881339363] [2022-04-08 00:50:02,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:50:02,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-08 00:50:02,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:50:02,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:50:02,307 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 00:50:02,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 00:50:02,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:50:02,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 00:50:02,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 00:50:02,308 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:50:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:02,763 INFO L93 Difference]: Finished difference Result 239 states and 335 transitions. [2022-04-08 00:50:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 00:50:02,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-08 00:50:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:50:02,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:50:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-08 00:50:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:50:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-08 00:50:02,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-08 00:50:02,824 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 00:50:02,830 INFO L225 Difference]: With dead ends: 239 [2022-04-08 00:50:02,830 INFO L226 Difference]: Without dead ends: 237 [2022-04-08 00:50:02,830 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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 00:50:02,831 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:50:02,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:50:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-08 00:50:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-04-08 00:50:03,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:50:03,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 00:50:03,138 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 00:50:03,139 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 00:50:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:03,146 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2022-04-08 00:50:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 331 transitions. [2022-04-08 00:50:03,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:03,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:03,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand 237 states. [2022-04-08 00:50:03,148 INFO L87 Difference]: Start difference. First operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand 237 states. [2022-04-08 00:50:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:03,155 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2022-04-08 00:50:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 331 transitions. [2022-04-08 00:50:03,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:03,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:03,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:50:03,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:50:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-08 00:50:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2022-04-08 00:50:03,164 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 39 [2022-04-08 00:50:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:50:03,164 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2022-04-08 00:50:03,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 00:50:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2022-04-08 00:50:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 00:50:03,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:50:03,165 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:50:03,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 00:50:03,391 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 00:50:03,391 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:50:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:50:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1057809952, now seen corresponding path program 1 times [2022-04-08 00:50:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:50:03,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836177167] [2022-04-08 00:50:03,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:03,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:50:03,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:50:03,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1709292804] [2022-04-08 00:50:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:03,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:50:03,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:50:03,415 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 00:50:03,424 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 00:50:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:03,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 00:50:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:03,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:50:03,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {7713#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:03,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {7713#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {7713#true} is VALID [2022-04-08 00:50:03,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {7713#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:03,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7713#true} {7713#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:03,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {7713#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:03,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {7713#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7713#true} is VALID [2022-04-08 00:50:03,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {7713#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {7713#true} is VALID [2022-04-08 00:50:03,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {7713#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {7713#true} is VALID [2022-04-08 00:50:03,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {7713#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:03,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {7713#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:03,824 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7713#true} {7713#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {7713#true} is VALID [2022-04-08 00:50:03,824 INFO L272 TraceCheckUtils]: 11: Hoare triple {7713#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {7713#true} is VALID [2022-04-08 00:50:03,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {7713#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {7713#true} is VALID [2022-04-08 00:50:03,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {7713#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:03,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {7713#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:03,825 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7713#true} {7713#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {7713#true} is VALID [2022-04-08 00:50:03,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {7713#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:03,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:03,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:03,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:03,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:03,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:03,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:03,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 00:50:03,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 00:50:03,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 00:50:03,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 00:50:03,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 00:50:03,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 00:50:03,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 00:50:03,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 00:50:03,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 00:50:03,835 INFO L272 TraceCheckUtils]: 32: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7713#true} is VALID [2022-04-08 00:50:03,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {7713#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7713#true} is VALID [2022-04-08 00:50:03,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {7713#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:03,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {7713#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:03,838 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7713#true} {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 00:50:03,838 INFO L272 TraceCheckUtils]: 37: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:50:03,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:50:03,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {7836#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {7714#false} is VALID [2022-04-08 00:50:03,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {7714#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7714#false} is VALID [2022-04-08 00:50:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 00:50:03,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:50:04,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {7714#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7714#false} is VALID [2022-04-08 00:50:04,081 INFO L290 TraceCheckUtils]: 39: Hoare triple {7836#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {7714#false} is VALID [2022-04-08 00:50:04,081 INFO L290 TraceCheckUtils]: 38: Hoare triple {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:50:04,082 INFO L272 TraceCheckUtils]: 37: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:50:04,083 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7713#true} {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:50:04,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {7713#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:04,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {7713#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:04,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {7713#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {7713#true} is VALID [2022-04-08 00:50:04,084 INFO L272 TraceCheckUtils]: 32: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7713#true} is VALID [2022-04-08 00:50:04,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:50:04,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:50:04,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:50:04,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:50:04,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:50:04,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:50:04,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:50:04,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:50:06,100 WARN L290 TraceCheckUtils]: 23: Hoare triple {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-08 00:50:06,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-08 00:50:06,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-08 00:50:06,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-08 00:50:06,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-08 00:50:06,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:50:06,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:50:06,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {7713#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:50:06,104 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7713#true} {7713#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {7713#true} is VALID [2022-04-08 00:50:06,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {7713#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:06,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {7713#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:06,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {7713#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {7713#true} is VALID [2022-04-08 00:50:06,105 INFO L272 TraceCheckUtils]: 11: Hoare triple {7713#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {7713#true} is VALID [2022-04-08 00:50:06,105 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7713#true} {7713#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {7713#true} is VALID [2022-04-08 00:50:06,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {7713#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:06,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {7713#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:06,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {7713#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {7713#true} is VALID [2022-04-08 00:50:06,106 INFO L272 TraceCheckUtils]: 6: Hoare triple {7713#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {7713#true} is VALID [2022-04-08 00:50:06,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {7713#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7713#true} is VALID [2022-04-08 00:50:06,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {7713#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:06,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7713#true} {7713#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:06,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {7713#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:06,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {7713#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {7713#true} is VALID [2022-04-08 00:50:06,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {7713#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7713#true} is VALID [2022-04-08 00:50:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 00:50:06,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:50:06,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836177167] [2022-04-08 00:50:06,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:50:06,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709292804] [2022-04-08 00:50:06,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709292804] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:50:06,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:50:06,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-08 00:50:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981848554] [2022-04-08 00:50:06,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:50:06,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-08 00:50:06,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:50:06,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 00:50:06,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:50:06,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 00:50:06,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:50:06,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 00:50:06,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-08 00:50:06,483 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 00:50:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:09,004 INFO L93 Difference]: Finished difference Result 392 states and 578 transitions. [2022-04-08 00:50:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 00:50:09,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-08 00:50:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:50:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 00:50:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-04-08 00:50:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 00:50:09,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-04-08 00:50:09,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 252 transitions. [2022-04-08 00:50:09,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:50:09,494 INFO L225 Difference]: With dead ends: 392 [2022-04-08 00:50:09,494 INFO L226 Difference]: Without dead ends: 390 [2022-04-08 00:50:09,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-08 00:50:09,495 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 157 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 00:50:09,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 334 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 00:50:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-04-08 00:50:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 377. [2022-04-08 00:50:09,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:50:09,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-08 00:50:09,982 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-08 00:50:09,983 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-08 00:50:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:09,997 INFO L93 Difference]: Finished difference Result 390 states and 576 transitions. [2022-04-08 00:50:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 576 transitions. [2022-04-08 00:50:09,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:09,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:10,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand 390 states. [2022-04-08 00:50:10,001 INFO L87 Difference]: Start difference. First operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand 390 states. [2022-04-08 00:50:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:10,015 INFO L93 Difference]: Finished difference Result 390 states and 576 transitions. [2022-04-08 00:50:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 576 transitions. [2022-04-08 00:50:10,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:10,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:10,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:50:10,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:50:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-08 00:50:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 563 transitions. [2022-04-08 00:50:10,032 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 563 transitions. Word has length 41 [2022-04-08 00:50:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:50:10,033 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 563 transitions. [2022-04-08 00:50:10,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 00:50:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 563 transitions. [2022-04-08 00:50:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 00:50:10,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:50:10,034 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:50:10,057 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 00:50:10,247 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 00:50:10,247 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:50:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:50:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash -800046763, now seen corresponding path program 1 times [2022-04-08 00:50:10,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:50:10,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358798053] [2022-04-08 00:50:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:10,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:50:10,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:50:10,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616024388] [2022-04-08 00:50:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:10,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:50:10,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:50:10,277 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 00:50:10,291 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 00:50:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:10,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 00:50:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:10,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:50:10,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {9884#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {9884#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {9884#true} is VALID [2022-04-08 00:50:10,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {9884#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9884#true} {9884#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {9884#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {9884#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {9884#true} is VALID [2022-04-08 00:50:10,465 INFO L272 TraceCheckUtils]: 6: Hoare triple {9884#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {9884#true} is VALID [2022-04-08 00:50:10,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {9884#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {9884#true} is VALID [2022-04-08 00:50:10,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {9884#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {9884#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,466 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9884#true} {9884#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {9884#true} is VALID [2022-04-08 00:50:10,466 INFO L272 TraceCheckUtils]: 11: Hoare triple {9884#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {9884#true} is VALID [2022-04-08 00:50:10,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {9884#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {9884#true} is VALID [2022-04-08 00:50:10,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {9884#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {9884#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,466 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9884#true} {9884#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {9884#true} is VALID [2022-04-08 00:50:10,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {9884#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {9884#true} is VALID [2022-04-08 00:50:10,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {9884#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {9884#true} is VALID [2022-04-08 00:50:10,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {9884#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {9884#true} is VALID [2022-04-08 00:50:10,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {9884#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {9884#true} is VALID [2022-04-08 00:50:10,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {9884#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {9884#true} is VALID [2022-04-08 00:50:10,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {9884#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {9884#true} is VALID [2022-04-08 00:50:10,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {9884#true} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-08 00:50:10,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-08 00:50:10,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-08 00:50:10,469 INFO L272 TraceCheckUtils]: 25: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9884#true} is VALID [2022-04-08 00:50:10,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {9884#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9884#true} is VALID [2022-04-08 00:50:10,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {9884#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {9884#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,470 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {9884#true} {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-08 00:50:10,470 INFO L272 TraceCheckUtils]: 30: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9884#true} is VALID [2022-04-08 00:50:10,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {9884#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9884#true} is VALID [2022-04-08 00:50:10,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {9884#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {9884#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,472 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9884#true} {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-08 00:50:10,472 INFO L272 TraceCheckUtils]: 35: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {9884#true} is VALID [2022-04-08 00:50:10,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {9884#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9884#true} is VALID [2022-04-08 00:50:10,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {9884#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {9884#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9884#true} is VALID [2022-04-08 00:50:10,473 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9884#true} {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-08 00:50:10,474 INFO L272 TraceCheckUtils]: 40: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {10010#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:50:10,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {10010#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {10014#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:50:10,474 INFO L290 TraceCheckUtils]: 42: Hoare triple {10014#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {9885#false} is VALID [2022-04-08 00:50:10,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {9885#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9885#false} is VALID [2022-04-08 00:50:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 00:50:10,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:50:10,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:50:10,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358798053] [2022-04-08 00:50:10,475 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:50:10,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616024388] [2022-04-08 00:50:10,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616024388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:50:10,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:50:10,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 00:50:10,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126896686] [2022-04-08 00:50:10,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:50:10,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-08 00:50:10,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:50:10,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 00:50:10,508 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 00:50:10,508 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 00:50:10,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:50:10,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 00:50:10,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 00:50:10,509 INFO L87 Difference]: Start difference. First operand 377 states and 563 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 00:50:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:11,463 INFO L93 Difference]: Finished difference Result 566 states and 887 transitions. [2022-04-08 00:50:11,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 00:50:11,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-08 00:50:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:50:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 00:50:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-08 00:50:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 00:50:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-08 00:50:11,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-08 00:50:11,521 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 00:50:11,544 INFO L225 Difference]: With dead ends: 566 [2022-04-08 00:50:11,544 INFO L226 Difference]: Without dead ends: 564 [2022-04-08 00:50:11,546 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 00:50:11,547 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:50:11,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:50:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-04-08 00:50:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 495. [2022-04-08 00:50:12,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:50:12,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-08 00:50:12,356 INFO L74 IsIncluded]: Start isIncluded. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-08 00:50:12,356 INFO L87 Difference]: Start difference. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-08 00:50:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:12,398 INFO L93 Difference]: Finished difference Result 564 states and 884 transitions. [2022-04-08 00:50:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2022-04-08 00:50:12,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:12,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:12,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 564 states. [2022-04-08 00:50:12,402 INFO L87 Difference]: Start difference. First operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 564 states. [2022-04-08 00:50:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:12,428 INFO L93 Difference]: Finished difference Result 564 states and 884 transitions. [2022-04-08 00:50:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2022-04-08 00:50:12,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:12,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:12,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:50:12,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:50:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-08 00:50:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 774 transitions. [2022-04-08 00:50:12,459 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 774 transitions. Word has length 44 [2022-04-08 00:50:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:50:12,459 INFO L478 AbstractCegarLoop]: Abstraction has 495 states and 774 transitions. [2022-04-08 00:50:12,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 00:50:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 774 transitions. [2022-04-08 00:50:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 00:50:12,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:50:12,460 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:50:12,489 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 00:50:12,671 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 00:50:12,672 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:50:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:50:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash 684933943, now seen corresponding path program 1 times [2022-04-08 00:50:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:50:12,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362885422] [2022-04-08 00:50:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:50:12,688 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:50:12,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [738743506] [2022-04-08 00:50:12,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:12,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:50:12,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:50:12,690 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 00:50:12,722 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 00:50:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:12,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 00:50:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:12,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:50:12,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {12762#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12762#true} is VALID [2022-04-08 00:50:12,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {12762#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {12770#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12770#(<= ~counter~0 0)} {12762#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {12770#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {12770#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,942 INFO L272 TraceCheckUtils]: 6: Hoare triple {12770#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {12770#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {12770#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {12770#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12770#(<= ~counter~0 0)} {12770#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,944 INFO L272 TraceCheckUtils]: 11: Hoare triple {12770#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {12770#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {12770#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {12770#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,945 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12770#(<= ~counter~0 0)} {12770#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {12770#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12770#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:12,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {12770#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12819#(<= ~counter~0 1)} is VALID [2022-04-08 00:50:12,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {12819#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12819#(<= ~counter~0 1)} is VALID [2022-04-08 00:50:12,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {12819#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12819#(<= ~counter~0 1)} is VALID [2022-04-08 00:50:12,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {12819#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12829#(<= ~counter~0 2)} is VALID [2022-04-08 00:50:12,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {12829#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12829#(<= ~counter~0 2)} is VALID [2022-04-08 00:50:12,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {12829#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {12829#(<= ~counter~0 2)} is VALID [2022-04-08 00:50:12,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {12829#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12829#(<= ~counter~0 2)} is VALID [2022-04-08 00:50:12,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {12829#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12842#(<= ~counter~0 3)} is VALID [2022-04-08 00:50:12,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {12842#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12842#(<= ~counter~0 3)} is VALID [2022-04-08 00:50:12,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {12842#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12842#(<= ~counter~0 3)} is VALID [2022-04-08 00:50:12,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {12842#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12852#(<= |main_#t~post7| 3)} is VALID [2022-04-08 00:50:12,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {12852#(<= |main_#t~post7| 3)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12763#false} is VALID [2022-04-08 00:50:12,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {12763#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12763#false} is VALID [2022-04-08 00:50:12,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {12763#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12763#false} is VALID [2022-04-08 00:50:12,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {12763#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12763#false} is VALID [2022-04-08 00:50:12,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {12763#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12763#false} is VALID [2022-04-08 00:50:12,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {12763#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12763#false} is VALID [2022-04-08 00:50:12,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {12763#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12763#false} is VALID [2022-04-08 00:50:12,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {12763#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12763#false} is VALID [2022-04-08 00:50:12,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {12763#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12763#false} is VALID [2022-04-08 00:50:12,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {12763#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12763#false} is VALID [2022-04-08 00:50:12,951 INFO L272 TraceCheckUtils]: 38: Hoare triple {12763#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12763#false} is VALID [2022-04-08 00:50:12,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {12763#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {12763#false} is VALID [2022-04-08 00:50:12,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {12763#false} [134] L11-->L12: 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[] {12763#false} is VALID [2022-04-08 00:50:12,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {12763#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12763#false} is VALID [2022-04-08 00:50:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 00:50:12,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:50:13,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {12763#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12763#false} is VALID [2022-04-08 00:50:13,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {12763#false} [134] L11-->L12: 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[] {12763#false} is VALID [2022-04-08 00:50:13,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {12763#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {12763#false} is VALID [2022-04-08 00:50:13,161 INFO L272 TraceCheckUtils]: 38: Hoare triple {12763#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12763#false} is VALID [2022-04-08 00:50:13,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {12763#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12763#false} is VALID [2022-04-08 00:50:13,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {12763#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12763#false} is VALID [2022-04-08 00:50:13,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {12763#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12763#false} is VALID [2022-04-08 00:50:13,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {12763#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12763#false} is VALID [2022-04-08 00:50:13,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {12763#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12763#false} is VALID [2022-04-08 00:50:13,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {12763#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12763#false} is VALID [2022-04-08 00:50:13,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {12763#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12763#false} is VALID [2022-04-08 00:50:13,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {12763#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12763#false} is VALID [2022-04-08 00:50:13,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {12763#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12763#false} is VALID [2022-04-08 00:50:13,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {12934#(< |main_#t~post7| 10)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12763#false} is VALID [2022-04-08 00:50:13,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {12938#(< ~counter~0 10)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12934#(< |main_#t~post7| 10)} is VALID [2022-04-08 00:50:13,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {12938#(< ~counter~0 10)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12938#(< ~counter~0 10)} is VALID [2022-04-08 00:50:13,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {12938#(< ~counter~0 10)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12938#(< ~counter~0 10)} is VALID [2022-04-08 00:50:13,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {12948#(< ~counter~0 9)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12938#(< ~counter~0 10)} is VALID [2022-04-08 00:50:13,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {12948#(< ~counter~0 9)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12948#(< ~counter~0 9)} is VALID [2022-04-08 00:50:13,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {12948#(< ~counter~0 9)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {12948#(< ~counter~0 9)} is VALID [2022-04-08 00:50:13,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {12948#(< ~counter~0 9)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12948#(< ~counter~0 9)} is VALID [2022-04-08 00:50:13,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {12961#(< ~counter~0 8)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {12948#(< ~counter~0 9)} is VALID [2022-04-08 00:50:13,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {12961#(< ~counter~0 8)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12961#(< ~counter~0 8)} is VALID [2022-04-08 00:50:13,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {12961#(< ~counter~0 8)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12961#(< ~counter~0 8)} is VALID [2022-04-08 00:50:13,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {12971#(< ~counter~0 7)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12961#(< ~counter~0 8)} is VALID [2022-04-08 00:50:13,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {12971#(< ~counter~0 7)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12971#(< ~counter~0 7)} is VALID [2022-04-08 00:50:13,167 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12762#true} {12971#(< ~counter~0 7)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {12971#(< ~counter~0 7)} is VALID [2022-04-08 00:50:13,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {12762#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12762#true} is VALID [2022-04-08 00:50:13,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {12762#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {12762#true} is VALID [2022-04-08 00:50:13,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {12762#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {12762#true} is VALID [2022-04-08 00:50:13,168 INFO L272 TraceCheckUtils]: 11: Hoare triple {12971#(< ~counter~0 7)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {12762#true} is VALID [2022-04-08 00:50:13,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12762#true} {12971#(< ~counter~0 7)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {12971#(< ~counter~0 7)} is VALID [2022-04-08 00:50:13,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {12762#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12762#true} is VALID [2022-04-08 00:50:13,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {12762#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {12762#true} is VALID [2022-04-08 00:50:13,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {12762#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {12762#true} is VALID [2022-04-08 00:50:13,169 INFO L272 TraceCheckUtils]: 6: Hoare triple {12971#(< ~counter~0 7)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {12762#true} is VALID [2022-04-08 00:50:13,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {12971#(< ~counter~0 7)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12971#(< ~counter~0 7)} is VALID [2022-04-08 00:50:13,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {12971#(< ~counter~0 7)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12971#(< ~counter~0 7)} is VALID [2022-04-08 00:50:13,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12971#(< ~counter~0 7)} {12762#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12971#(< ~counter~0 7)} is VALID [2022-04-08 00:50:13,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {12971#(< ~counter~0 7)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12971#(< ~counter~0 7)} is VALID [2022-04-08 00:50:13,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {12762#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {12971#(< ~counter~0 7)} is VALID [2022-04-08 00:50:13,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {12762#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12762#true} is VALID [2022-04-08 00:50:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 00:50:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:50:13,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362885422] [2022-04-08 00:50:13,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:50:13,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738743506] [2022-04-08 00:50:13,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738743506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:50:13,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:50:13,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 00:50:13,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341989557] [2022-04-08 00:50:13,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:50:13,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-08 00:50:13,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:50:13,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:50:13,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:50:13,210 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 00:50:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:50:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 00:50:13,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 00:50:13,211 INFO L87 Difference]: Start difference. First operand 495 states and 774 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:50:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:15,250 INFO L93 Difference]: Finished difference Result 1127 states and 1721 transitions. [2022-04-08 00:50:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 00:50:15,250 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-08 00:50:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:50:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:50:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 224 transitions. [2022-04-08 00:50:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:50:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 224 transitions. [2022-04-08 00:50:15,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 224 transitions. [2022-04-08 00:50:15,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:50:15,502 INFO L225 Difference]: With dead ends: 1127 [2022-04-08 00:50:15,502 INFO L226 Difference]: Without dead ends: 770 [2022-04-08 00:50:15,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-04-08 00:50:15,505 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 156 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 00:50:15,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 390 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 00:50:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-04-08 00:50:16,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 736. [2022-04-08 00:50:16,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:50:16,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-08 00:50:16,667 INFO L74 IsIncluded]: Start isIncluded. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-08 00:50:16,668 INFO L87 Difference]: Start difference. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-08 00:50:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:16,708 INFO L93 Difference]: Finished difference Result 770 states and 1118 transitions. [2022-04-08 00:50:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1118 transitions. [2022-04-08 00:50:16,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:16,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:16,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) Second operand 770 states. [2022-04-08 00:50:16,714 INFO L87 Difference]: Start difference. First operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) Second operand 770 states. [2022-04-08 00:50:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:16,752 INFO L93 Difference]: Finished difference Result 770 states and 1118 transitions. [2022-04-08 00:50:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1118 transitions. [2022-04-08 00:50:16,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:16,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:16,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:50:16,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:50:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-08 00:50:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1085 transitions. [2022-04-08 00:50:16,800 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1085 transitions. Word has length 42 [2022-04-08 00:50:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:50:16,800 INFO L478 AbstractCegarLoop]: Abstraction has 736 states and 1085 transitions. [2022-04-08 00:50:16,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:50:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1085 transitions. [2022-04-08 00:50:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 00:50:16,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:50:16,801 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:50:16,827 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 00:50:17,023 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 00:50:17,024 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:50:17,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:50:17,024 INFO L85 PathProgramCache]: Analyzing trace with hash 841576990, now seen corresponding path program 1 times [2022-04-08 00:50:17,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:50:17,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533618931] [2022-04-08 00:50:17,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:17,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:50:17,044 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:50:17,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599705494] [2022-04-08 00:50:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:17,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:50:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:50:17,048 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 00:50:17,075 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 00:50:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:17,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 00:50:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:17,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:50:17,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {17410#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17410#true} is VALID [2022-04-08 00:50:17,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {17410#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {17418#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17418#(<= ~counter~0 0)} {17410#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {17418#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {17418#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {17418#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {17418#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {17418#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {17418#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,345 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17418#(<= ~counter~0 0)} {17418#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,345 INFO L272 TraceCheckUtils]: 11: Hoare triple {17418#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {17418#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {17418#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {17418#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,348 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17418#(<= ~counter~0 0)} {17418#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {17418#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17418#(<= ~counter~0 0)} is VALID [2022-04-08 00:50:17,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {17418#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {17467#(<= ~counter~0 1)} is VALID [2022-04-08 00:50:17,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {17467#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {17467#(<= ~counter~0 1)} is VALID [2022-04-08 00:50:17,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {17467#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {17467#(<= ~counter~0 1)} is VALID [2022-04-08 00:50:17,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {17467#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {17477#(<= ~counter~0 2)} is VALID [2022-04-08 00:50:17,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {17477#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {17477#(<= ~counter~0 2)} is VALID [2022-04-08 00:50:17,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {17477#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {17477#(<= ~counter~0 2)} is VALID [2022-04-08 00:50:17,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {17477#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17477#(<= ~counter~0 2)} is VALID [2022-04-08 00:50:17,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {17477#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {17490#(<= ~counter~0 3)} is VALID [2022-04-08 00:50:17,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {17490#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {17490#(<= ~counter~0 3)} is VALID [2022-04-08 00:50:17,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {17490#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {17490#(<= ~counter~0 3)} is VALID [2022-04-08 00:50:17,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {17490#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {17500#(<= ~counter~0 4)} is VALID [2022-04-08 00:50:17,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {17500#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {17500#(<= ~counter~0 4)} is VALID [2022-04-08 00:50:17,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {17500#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {17500#(<= ~counter~0 4)} is VALID [2022-04-08 00:50:17,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {17500#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {17510#(<= |main_#t~post8| 4)} is VALID [2022-04-08 00:50:17,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {17510#(<= |main_#t~post8| 4)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {17411#false} is VALID [2022-04-08 00:50:17,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {17411#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {17411#false} is VALID [2022-04-08 00:50:17,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {17411#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {17411#false} is VALID [2022-04-08 00:50:17,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {17411#false} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {17411#false} is VALID [2022-04-08 00:50:17,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {17411#false} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {17411#false} is VALID [2022-04-08 00:50:17,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {17411#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17411#false} is VALID [2022-04-08 00:50:17,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {17411#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {17411#false} is VALID [2022-04-08 00:50:17,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {17411#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {17411#false} is VALID [2022-04-08 00:50:17,358 INFO L272 TraceCheckUtils]: 39: Hoare triple {17411#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17411#false} is VALID [2022-04-08 00:50:17,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {17411#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {17411#false} is VALID [2022-04-08 00:50:17,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {17411#false} [134] L11-->L12: 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[] {17411#false} is VALID [2022-04-08 00:50:17,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {17411#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17411#false} is VALID [2022-04-08 00:50:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 00:50:17,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:50:17,603 INFO L290 TraceCheckUtils]: 42: Hoare triple {17411#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17411#false} is VALID [2022-04-08 00:50:17,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {17411#false} [134] L11-->L12: 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[] {17411#false} is VALID [2022-04-08 00:50:17,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {17411#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {17411#false} is VALID [2022-04-08 00:50:17,603 INFO L272 TraceCheckUtils]: 39: Hoare triple {17411#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17411#false} is VALID [2022-04-08 00:50:17,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {17411#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {17411#false} is VALID [2022-04-08 00:50:17,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {17411#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {17411#false} is VALID [2022-04-08 00:50:17,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {17411#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17411#false} is VALID [2022-04-08 00:50:17,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {17411#false} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {17411#false} is VALID [2022-04-08 00:50:17,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {17411#false} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {17411#false} is VALID [2022-04-08 00:50:17,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {17411#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {17411#false} is VALID [2022-04-08 00:50:17,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {17411#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {17411#false} is VALID [2022-04-08 00:50:17,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {17580#(< |main_#t~post8| 10)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 10)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {17411#false} is VALID [2022-04-08 00:50:17,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {17584#(< ~counter~0 10)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {17580#(< |main_#t~post8| 10)} is VALID [2022-04-08 00:50:17,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {17584#(< ~counter~0 10)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {17584#(< ~counter~0 10)} is VALID [2022-04-08 00:50:17,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {17584#(< ~counter~0 10)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {17584#(< ~counter~0 10)} is VALID [2022-04-08 00:50:17,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {17594#(< ~counter~0 9)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {17584#(< ~counter~0 10)} is VALID [2022-04-08 00:50:17,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {17594#(< ~counter~0 9)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {17594#(< ~counter~0 9)} is VALID [2022-04-08 00:50:17,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {17594#(< ~counter~0 9)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {17594#(< ~counter~0 9)} is VALID [2022-04-08 00:50:17,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {17604#(< ~counter~0 8)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {17594#(< ~counter~0 9)} is VALID [2022-04-08 00:50:17,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {17604#(< ~counter~0 8)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17604#(< ~counter~0 8)} is VALID [2022-04-08 00:50:17,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {17604#(< ~counter~0 8)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {17604#(< ~counter~0 8)} is VALID [2022-04-08 00:50:17,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {17604#(< ~counter~0 8)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {17604#(< ~counter~0 8)} is VALID [2022-04-08 00:50:17,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {17617#(< ~counter~0 7)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {17604#(< ~counter~0 8)} is VALID [2022-04-08 00:50:17,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {17617#(< ~counter~0 7)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {17617#(< ~counter~0 7)} is VALID [2022-04-08 00:50:17,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {17617#(< ~counter~0 7)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {17617#(< ~counter~0 7)} is VALID [2022-04-08 00:50:17,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {17627#(< ~counter~0 6)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {17617#(< ~counter~0 7)} is VALID [2022-04-08 00:50:17,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {17627#(< ~counter~0 6)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17627#(< ~counter~0 6)} is VALID [2022-04-08 00:50:17,633 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17410#true} {17627#(< ~counter~0 6)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {17627#(< ~counter~0 6)} is VALID [2022-04-08 00:50:17,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {17410#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17410#true} is VALID [2022-04-08 00:50:17,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {17410#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {17410#true} is VALID [2022-04-08 00:50:17,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {17410#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {17410#true} is VALID [2022-04-08 00:50:17,634 INFO L272 TraceCheckUtils]: 11: Hoare triple {17627#(< ~counter~0 6)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {17410#true} is VALID [2022-04-08 00:50:17,634 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17410#true} {17627#(< ~counter~0 6)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {17627#(< ~counter~0 6)} is VALID [2022-04-08 00:50:17,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {17410#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17410#true} is VALID [2022-04-08 00:50:17,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {17410#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {17410#true} is VALID [2022-04-08 00:50:17,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {17410#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {17410#true} is VALID [2022-04-08 00:50:17,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {17627#(< ~counter~0 6)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {17410#true} is VALID [2022-04-08 00:50:17,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {17627#(< ~counter~0 6)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17627#(< ~counter~0 6)} is VALID [2022-04-08 00:50:17,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {17627#(< ~counter~0 6)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17627#(< ~counter~0 6)} is VALID [2022-04-08 00:50:17,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17627#(< ~counter~0 6)} {17410#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17627#(< ~counter~0 6)} is VALID [2022-04-08 00:50:17,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {17627#(< ~counter~0 6)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17627#(< ~counter~0 6)} is VALID [2022-04-08 00:50:17,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {17410#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {17627#(< ~counter~0 6)} is VALID [2022-04-08 00:50:17,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {17410#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17410#true} is VALID [2022-04-08 00:50:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 00:50:17,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:50:17,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533618931] [2022-04-08 00:50:17,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:50:17,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599705494] [2022-04-08 00:50:17,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599705494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:50:17,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:50:17,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 00:50:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426874974] [2022-04-08 00:50:17,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:50:17,640 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-08 00:50:17,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:50:17,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:50:17,685 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 00:50:17,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 00:50:17,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:50:17,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 00:50:17,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 00:50:17,686 INFO L87 Difference]: Start difference. First operand 736 states and 1085 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:50:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:20,482 INFO L93 Difference]: Finished difference Result 1597 states and 2379 transitions. [2022-04-08 00:50:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 00:50:20,483 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-08 00:50:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:50:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:50:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2022-04-08 00:50:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:50:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2022-04-08 00:50:20,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 281 transitions. [2022-04-08 00:50:20,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:50:20,823 INFO L225 Difference]: With dead ends: 1597 [2022-04-08 00:50:20,823 INFO L226 Difference]: Without dead ends: 1119 [2022-04-08 00:50:20,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2022-04-08 00:50:20,827 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 237 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 00:50:20,828 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 405 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 00:50:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-04-08 00:50:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1072. [2022-04-08 00:50:22,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:50:22,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-08 00:50:22,562 INFO L74 IsIncluded]: Start isIncluded. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-08 00:50:22,563 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-08 00:50:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:22,630 INFO L93 Difference]: Finished difference Result 1119 states and 1584 transitions. [2022-04-08 00:50:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1584 transitions. [2022-04-08 00:50:22,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:22,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:22,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) Second operand 1119 states. [2022-04-08 00:50:22,637 INFO L87 Difference]: Start difference. First operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) Second operand 1119 states. [2022-04-08 00:50:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:22,701 INFO L93 Difference]: Finished difference Result 1119 states and 1584 transitions. [2022-04-08 00:50:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1584 transitions. [2022-04-08 00:50:22,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:22,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:22,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:50:22,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:50:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-08 00:50:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1543 transitions. [2022-04-08 00:50:22,788 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1543 transitions. Word has length 43 [2022-04-08 00:50:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:50:22,788 INFO L478 AbstractCegarLoop]: Abstraction has 1072 states and 1543 transitions. [2022-04-08 00:50:22,788 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 00:50:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1543 transitions. [2022-04-08 00:50:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 00:50:22,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:50:22,789 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:50:22,812 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 00:50:23,004 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 00:50:23,005 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:50:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:50:23,005 INFO L85 PathProgramCache]: Analyzing trace with hash -799775801, now seen corresponding path program 2 times [2022-04-08 00:50:23,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:50:23,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610101110] [2022-04-08 00:50:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:50:23,020 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:50:23,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113348523] [2022-04-08 00:50:23,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 00:50:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:50:23,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:50:23,026 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 00:50:23,039 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 00:50:23,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 00:50:23,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 00:50:23,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 00:50:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:23,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:50:23,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {23972#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23972#true} is VALID [2022-04-08 00:50:23,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {23972#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {23972#true} is VALID [2022-04-08 00:50:23,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {23972#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23972#true} is VALID [2022-04-08 00:50:23,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23972#true} {23972#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23972#true} is VALID [2022-04-08 00:50:23,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {23972#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23972#true} is VALID [2022-04-08 00:50:23,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {23972#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23972#true} is VALID [2022-04-08 00:50:23,232 INFO L272 TraceCheckUtils]: 6: Hoare triple {23972#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {23972#true} is VALID [2022-04-08 00:50:23,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {23972#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {23972#true} is VALID [2022-04-08 00:50:23,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {23972#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {23972#true} is VALID [2022-04-08 00:50:23,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {23972#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23972#true} is VALID [2022-04-08 00:50:23,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23972#true} {23972#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {23972#true} is VALID [2022-04-08 00:50:23,233 INFO L272 TraceCheckUtils]: 11: Hoare triple {23972#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {23972#true} is VALID [2022-04-08 00:50:23,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {23972#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {23972#true} is VALID [2022-04-08 00:50:23,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {23972#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {23972#true} is VALID [2022-04-08 00:50:23,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {23972#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23972#true} is VALID [2022-04-08 00:50:23,233 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23972#true} {23972#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {23972#true} is VALID [2022-04-08 00:50:23,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {23972#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23972#true} is VALID [2022-04-08 00:50:23,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {23972#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {23972#true} is VALID [2022-04-08 00:50:23,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {23972#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {23972#true} is VALID [2022-04-08 00:50:23,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {23972#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {23972#true} is VALID [2022-04-08 00:50:23,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {23972#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {23972#true} is VALID [2022-04-08 00:50:23,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {23972#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {23972#true} is VALID [2022-04-08 00:50:23,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {23972#true} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {24043#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 00:50:23,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {24043#(not (<= main_~b~0 main_~c~0))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {24047#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 00:50:23,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {24047#(< main_~b~0 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {24047#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 00:50:23,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {24047#(< main_~b~0 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {24047#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 00:50:23,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {24047#(< main_~b~0 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {24057#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 00:50:23,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {24057#(< main_~b~0 main_~c~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {24057#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 00:50:23,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {24057#(< main_~b~0 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {24057#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 00:50:23,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {24057#(< main_~b~0 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {23973#false} is VALID [2022-04-08 00:50:23,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {23973#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23973#false} is VALID [2022-04-08 00:50:23,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {23973#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {23973#false} is VALID [2022-04-08 00:50:23,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {23973#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {23973#false} is VALID [2022-04-08 00:50:23,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {23973#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {23973#false} is VALID [2022-04-08 00:50:23,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {23973#false} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {23973#false} is VALID [2022-04-08 00:50:23,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {23973#false} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {23973#false} is VALID [2022-04-08 00:50:23,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {23973#false} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {23973#false} is VALID [2022-04-08 00:50:23,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {23973#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23973#false} is VALID [2022-04-08 00:50:23,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {23973#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {23973#false} is VALID [2022-04-08 00:50:23,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {23973#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {23973#false} is VALID [2022-04-08 00:50:23,239 INFO L272 TraceCheckUtils]: 40: Hoare triple {23973#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {23973#false} is VALID [2022-04-08 00:50:23,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {23973#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23973#false} is VALID [2022-04-08 00:50:23,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {23973#false} [134] L11-->L12: 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[] {23973#false} is VALID [2022-04-08 00:50:23,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {23973#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23973#false} is VALID [2022-04-08 00:50:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 00:50:23,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:50:23,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:50:23,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610101110] [2022-04-08 00:50:23,240 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:50:23,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113348523] [2022-04-08 00:50:23,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113348523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:50:23,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:50:23,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 00:50:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038582435] [2022-04-08 00:50:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:50:23,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-04-08 00:50:23,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:50:23,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:50:23,273 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 00:50:23,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 00:50:23,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:50:23,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 00:50:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 00:50:23,274 INFO L87 Difference]: Start difference. First operand 1072 states and 1543 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:50:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:26,014 INFO L93 Difference]: Finished difference Result 1700 states and 2539 transitions. [2022-04-08 00:50:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 00:50:26,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-04-08 00:50:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:50:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:50:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-08 00:50:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:50:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-08 00:50:26,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-08 00:50:26,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:50:26,210 INFO L225 Difference]: With dead ends: 1700 [2022-04-08 00:50:26,210 INFO L226 Difference]: Without dead ends: 1234 [2022-04-08 00:50:26,212 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 00:50:26,212 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 00:50:26,212 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 170 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 00:50:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-04-08 00:50:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 995. [2022-04-08 00:50:27,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:50:27,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-08 00:50:27,949 INFO L74 IsIncluded]: Start isIncluded. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-08 00:50:27,950 INFO L87 Difference]: Start difference. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-08 00:50:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:28,037 INFO L93 Difference]: Finished difference Result 1234 states and 1815 transitions. [2022-04-08 00:50:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1815 transitions. [2022-04-08 00:50:28,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:28,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:28,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) Second operand 1234 states. [2022-04-08 00:50:28,045 INFO L87 Difference]: Start difference. First operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) Second operand 1234 states. [2022-04-08 00:50:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:50:28,128 INFO L93 Difference]: Finished difference Result 1234 states and 1815 transitions. [2022-04-08 00:50:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1815 transitions. [2022-04-08 00:50:28,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:50:28,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:50:28,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:50:28,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:50:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-08 00:50:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1408 transitions. [2022-04-08 00:50:28,222 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1408 transitions. Word has length 44 [2022-04-08 00:50:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:50:28,223 INFO L478 AbstractCegarLoop]: Abstraction has 995 states and 1408 transitions. [2022-04-08 00:50:28,223 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 00:50:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1408 transitions. [2022-04-08 00:50:28,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 00:50:28,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:50:28,224 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:50:28,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 00:50:28,444 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 00:50:28,445 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:50:28,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:50:28,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2059301326, now seen corresponding path program 1 times [2022-04-08 00:50:28,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:50:28,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007421637] [2022-04-08 00:50:28,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:28,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:50:28,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:50:28,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605252481] [2022-04-08 00:50:28,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:50:28,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:50:28,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:50:28,469 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 00:50:28,493 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 00:50:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:28,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-08 00:50:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:50:28,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:50:29,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {30652#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {30652#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {30652#true} is VALID [2022-04-08 00:50:29,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {30652#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30652#true} {30652#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {30652#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {30652#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {30652#true} is VALID [2022-04-08 00:50:29,318 INFO L272 TraceCheckUtils]: 6: Hoare triple {30652#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {30652#true} is VALID [2022-04-08 00:50:29,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {30652#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {30652#true} is VALID [2022-04-08 00:50:29,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {30652#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {30652#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,319 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30652#true} {30652#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {30652#true} is VALID [2022-04-08 00:50:29,319 INFO L272 TraceCheckUtils]: 11: Hoare triple {30652#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {30652#true} is VALID [2022-04-08 00:50:29,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {30652#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {30652#true} is VALID [2022-04-08 00:50:29,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {30652#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {30652#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,320 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30652#true} {30652#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {30652#true} is VALID [2022-04-08 00:50:29,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {30652#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,324 INFO L272 TraceCheckUtils]: 25: Hoare triple {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {30652#true} is VALID [2022-04-08 00:50:29,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {30652#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:50:29,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:50:29,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:50:29,327 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,327 INFO L272 TraceCheckUtils]: 30: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {30652#true} is VALID [2022-04-08 00:50:29,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {30652#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:50:29,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:50:29,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:50:29,329 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,329 INFO L272 TraceCheckUtils]: 35: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {30652#true} is VALID [2022-04-08 00:50:29,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {30652#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30652#true} is VALID [2022-04-08 00:50:29,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {30652#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {30652#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,330 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30652#true} {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,330 INFO L272 TraceCheckUtils]: 40: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {30652#true} is VALID [2022-04-08 00:50:29,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {30652#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30652#true} is VALID [2022-04-08 00:50:29,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {30652#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {30652#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:50:29,331 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {30652#true} {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,333 INFO L290 TraceCheckUtils]: 47: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 00:50:29,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:50:29,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:50:29,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:50:29,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {30824#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} is VALID [2022-04-08 00:50:29,337 INFO L272 TraceCheckUtils]: 54: Hoare triple {30824#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:50:29,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:50:29,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {30832#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {30653#false} is VALID [2022-04-08 00:50:29,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {30653#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30653#false} is VALID [2022-04-08 00:50:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 00:50:29,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:51:16,419 INFO L290 TraceCheckUtils]: 57: Hoare triple {30653#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30653#false} is VALID [2022-04-08 00:51:16,419 INFO L290 TraceCheckUtils]: 56: Hoare triple {30832#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {30653#false} is VALID [2022-04-08 00:51:16,420 INFO L290 TraceCheckUtils]: 55: Hoare triple {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:51:16,421 INFO L272 TraceCheckUtils]: 54: Hoare triple {30848#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:51:16,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {30848#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:51:16,422 INFO L290 TraceCheckUtils]: 52: Hoare triple {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 00:51:16,422 INFO L290 TraceCheckUtils]: 51: Hoare triple {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 00:51:16,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 00:51:16,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,796 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {30652#true} {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {30652#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {30652#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {30652#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30652#true} is VALID [2022-04-08 00:51:16,796 INFO L272 TraceCheckUtils]: 40: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {30652#true} is VALID [2022-04-08 00:51:16,797 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30652#true} {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {30652#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {30652#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {30652#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30652#true} is VALID [2022-04-08 00:51:16,797 INFO L272 TraceCheckUtils]: 35: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {30652#true} is VALID [2022-04-08 00:51:16,798 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30912#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:51:16,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:51:16,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {30652#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:51:16,799 INFO L272 TraceCheckUtils]: 30: Hoare triple {30912#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {30652#true} is VALID [2022-04-08 00:51:16,801 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {30912#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:51:16,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:51:16,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {30652#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:51:16,802 INFO L272 TraceCheckUtils]: 25: Hoare triple {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {30652#true} is VALID [2022-04-08 00:51:16,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:51:16,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-08 00:51:16,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-08 00:51:16,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {30652#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-08 00:51:16,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {30652#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {30652#true} is VALID [2022-04-08 00:51:16,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {30652#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {30652#true} is VALID [2022-04-08 00:51:16,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {30652#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {30652#true} is VALID [2022-04-08 00:51:16,807 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30652#true} {30652#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {30652#true} is VALID [2022-04-08 00:51:16,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {30652#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {30652#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {30652#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {30652#true} is VALID [2022-04-08 00:51:16,807 INFO L272 TraceCheckUtils]: 11: Hoare triple {30652#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {30652#true} is VALID [2022-04-08 00:51:16,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30652#true} {30652#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {30652#true} is VALID [2022-04-08 00:51:16,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {30652#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {30652#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {30652#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {30652#true} is VALID [2022-04-08 00:51:16,807 INFO L272 TraceCheckUtils]: 6: Hoare triple {30652#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {30652#true} is VALID [2022-04-08 00:51:16,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {30652#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {30652#true} is VALID [2022-04-08 00:51:16,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {30652#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30652#true} {30652#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {30652#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {30652#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {30652#true} is VALID [2022-04-08 00:51:16,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {30652#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30652#true} is VALID [2022-04-08 00:51:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 00:51:16,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:51:16,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007421637] [2022-04-08 00:51:16,809 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:51:16,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605252481] [2022-04-08 00:51:16,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605252481] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:51:16,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:51:16,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-08 00:51:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782128156] [2022-04-08 00:51:16,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:51:16,810 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-08 00:51:16,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:51:16,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-08 00:51:17,076 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 00:51:17,077 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 00:51:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:51:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 00:51:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-08 00:51:17,077 INFO L87 Difference]: Start difference. First operand 995 states and 1408 transitions. Second operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-08 00:51:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:51:40,697 INFO L93 Difference]: Finished difference Result 1412 states and 2014 transitions. [2022-04-08 00:51:40,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 00:51:40,697 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-08 00:51:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:51:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-08 00:51:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 308 transitions. [2022-04-08 00:51:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-08 00:51:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 308 transitions. [2022-04-08 00:51:40,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 308 transitions. [2022-04-08 00:51:47,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 307 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 00:51:48,056 INFO L225 Difference]: With dead ends: 1412 [2022-04-08 00:51:48,057 INFO L226 Difference]: Without dead ends: 1404 [2022-04-08 00:51:48,058 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 00:51:48,058 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 166 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-08 00:51:48,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 669 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-04-08 00:51:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-04-08 00:51:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1226. [2022-04-08 00:51:50,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:51:50,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:51:50,191 INFO L74 IsIncluded]: Start isIncluded. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:51:50,192 INFO L87 Difference]: Start difference. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:51:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:51:50,290 INFO L93 Difference]: Finished difference Result 1404 states and 1984 transitions. [2022-04-08 00:51:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1984 transitions. [2022-04-08 00:51:50,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:51:50,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:51:50,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1404 states. [2022-04-08 00:51:50,299 INFO L87 Difference]: Start difference. First operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1404 states. [2022-04-08 00:51:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:51:50,396 INFO L93 Difference]: Finished difference Result 1404 states and 1984 transitions. [2022-04-08 00:51:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1984 transitions. [2022-04-08 00:51:50,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:51:50,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:51:50,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:51:50,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:51:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:51:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1707 transitions. [2022-04-08 00:51:50,497 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1707 transitions. Word has length 58 [2022-04-08 00:51:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:51:50,499 INFO L478 AbstractCegarLoop]: Abstraction has 1226 states and 1707 transitions. [2022-04-08 00:51:50,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-08 00:51:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1707 transitions. [2022-04-08 00:51:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 00:51:50,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:51:50,500 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:51:50,524 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 00:51:50,719 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 00:51:50,719 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:51:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:51:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1248898955, now seen corresponding path program 1 times [2022-04-08 00:51:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:51:50,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826485130] [2022-04-08 00:51:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:51:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:51:50,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:51:50,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1582136299] [2022-04-08 00:51:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:51:50,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:51:50,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:51:50,742 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 00:51:50,743 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 00:51:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:51:50,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 00:51:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:51:50,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:51:51,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {37759#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {37759#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {37767#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37767#(<= ~counter~0 0)} {37759#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {37767#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {37767#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {37767#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {37767#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {37767#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {37767#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37767#(<= ~counter~0 0)} {37767#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,239 INFO L272 TraceCheckUtils]: 11: Hoare triple {37767#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {37767#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {37767#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {37767#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,241 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37767#(<= ~counter~0 0)} {37767#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {37767#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {37767#(<= ~counter~0 0)} is VALID [2022-04-08 00:51:51,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {37767#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {37816#(<= ~counter~0 1)} is VALID [2022-04-08 00:51:51,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {37816#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {37816#(<= ~counter~0 1)} is VALID [2022-04-08 00:51:51,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {37816#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {37816#(<= ~counter~0 1)} is VALID [2022-04-08 00:51:51,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {37816#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {37826#(<= ~counter~0 2)} is VALID [2022-04-08 00:51:51,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {37826#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {37826#(<= ~counter~0 2)} is VALID [2022-04-08 00:51:51,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {37826#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {37826#(<= ~counter~0 2)} is VALID [2022-04-08 00:51:51,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {37826#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {37826#(<= ~counter~0 2)} is VALID [2022-04-08 00:51:51,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {37826#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {37839#(<= ~counter~0 3)} is VALID [2022-04-08 00:51:51,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {37839#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {37839#(<= ~counter~0 3)} is VALID [2022-04-08 00:51:51,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {37839#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {37839#(<= ~counter~0 3)} is VALID [2022-04-08 00:51:51,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {37839#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {37849#(<= ~counter~0 4)} is VALID [2022-04-08 00:51:51,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {37849#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {37849#(<= ~counter~0 4)} is VALID [2022-04-08 00:51:51,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {37849#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {37849#(<= ~counter~0 4)} is VALID [2022-04-08 00:51:51,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {37849#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {37859#(<= ~counter~0 5)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,250 INFO L272 TraceCheckUtils]: 32: Hoare triple {37859#(<= ~counter~0 5)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {37859#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {37859#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {37859#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,252 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,253 INFO L272 TraceCheckUtils]: 37: Hoare triple {37859#(<= ~counter~0 5)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {37859#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {37859#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {37859#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,255 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,255 INFO L272 TraceCheckUtils]: 42: Hoare triple {37859#(<= ~counter~0 5)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {37859#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {37859#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,264 INFO L290 TraceCheckUtils]: 45: Hoare triple {37859#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,264 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,265 INFO L272 TraceCheckUtils]: 47: Hoare triple {37859#(<= ~counter~0 5)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {37859#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {37859#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {37859#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,267 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {37859#(<= ~counter~0 5)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {37859#(<= ~counter~0 5)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {37859#(<= ~counter~0 5)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {37932#(<= ~counter~0 6)} is VALID [2022-04-08 00:51:51,269 INFO L290 TraceCheckUtils]: 55: Hoare triple {37932#(<= ~counter~0 6)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {37932#(<= ~counter~0 6)} is VALID [2022-04-08 00:51:51,269 INFO L290 TraceCheckUtils]: 56: Hoare triple {37932#(<= ~counter~0 6)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {37932#(<= ~counter~0 6)} is VALID [2022-04-08 00:51:51,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {37932#(<= ~counter~0 6)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {37932#(<= ~counter~0 6)} is VALID [2022-04-08 00:51:51,270 INFO L290 TraceCheckUtils]: 58: Hoare triple {37932#(<= ~counter~0 6)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {37945#(<= |main_#t~post6| 6)} is VALID [2022-04-08 00:51:51,270 INFO L290 TraceCheckUtils]: 59: Hoare triple {37945#(<= |main_#t~post6| 6)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {37760#false} is VALID [2022-04-08 00:51:51,271 INFO L272 TraceCheckUtils]: 60: Hoare triple {37760#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {37760#false} is VALID [2022-04-08 00:51:51,271 INFO L290 TraceCheckUtils]: 61: Hoare triple {37760#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37760#false} is VALID [2022-04-08 00:51:51,271 INFO L290 TraceCheckUtils]: 62: Hoare triple {37760#false} [134] L11-->L12: 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[] {37760#false} is VALID [2022-04-08 00:51:51,271 INFO L290 TraceCheckUtils]: 63: Hoare triple {37760#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37760#false} is VALID [2022-04-08 00:51:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 00:51:51,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:51:51,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {37760#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37760#false} is VALID [2022-04-08 00:51:51,687 INFO L290 TraceCheckUtils]: 62: Hoare triple {37760#false} [134] L11-->L12: 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[] {37760#false} is VALID [2022-04-08 00:51:51,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {37760#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37760#false} is VALID [2022-04-08 00:51:51,687 INFO L272 TraceCheckUtils]: 60: Hoare triple {37760#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {37760#false} is VALID [2022-04-08 00:51:51,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {37973#(< |main_#t~post6| 10)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {37760#false} is VALID [2022-04-08 00:51:51,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {37977#(< ~counter~0 10)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {37973#(< |main_#t~post6| 10)} is VALID [2022-04-08 00:51:51,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {37977#(< ~counter~0 10)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {37977#(< ~counter~0 10)} is VALID [2022-04-08 00:51:51,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {37977#(< ~counter~0 10)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {37977#(< ~counter~0 10)} is VALID [2022-04-08 00:51:51,689 INFO L290 TraceCheckUtils]: 55: Hoare triple {37977#(< ~counter~0 10)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {37977#(< ~counter~0 10)} is VALID [2022-04-08 00:51:51,690 INFO L290 TraceCheckUtils]: 54: Hoare triple {37990#(< ~counter~0 9)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {37977#(< ~counter~0 10)} is VALID [2022-04-08 00:51:51,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {37990#(< ~counter~0 9)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {37990#(< ~counter~0 9)} is VALID [2022-04-08 00:51:51,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {37990#(< ~counter~0 9)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {37990#(< ~counter~0 9)} is VALID [2022-04-08 00:51:51,692 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {37759#true} {37990#(< ~counter~0 9)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {37990#(< ~counter~0 9)} is VALID [2022-04-08 00:51:51,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {37759#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {37759#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,692 INFO L290 TraceCheckUtils]: 48: Hoare triple {37759#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37759#true} is VALID [2022-04-08 00:51:51,692 INFO L272 TraceCheckUtils]: 47: Hoare triple {37990#(< ~counter~0 9)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {37759#true} is VALID [2022-04-08 00:51:51,693 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37759#true} {37990#(< ~counter~0 9)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {37990#(< ~counter~0 9)} is VALID [2022-04-08 00:51:51,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {37759#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {37759#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,694 INFO L290 TraceCheckUtils]: 43: Hoare triple {37759#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37759#true} is VALID [2022-04-08 00:51:51,694 INFO L272 TraceCheckUtils]: 42: Hoare triple {37990#(< ~counter~0 9)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {37759#true} is VALID [2022-04-08 00:51:51,694 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37759#true} {37990#(< ~counter~0 9)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {37990#(< ~counter~0 9)} is VALID [2022-04-08 00:51:51,695 INFO L290 TraceCheckUtils]: 40: Hoare triple {37759#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {37759#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {37759#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37759#true} is VALID [2022-04-08 00:51:51,695 INFO L272 TraceCheckUtils]: 37: Hoare triple {37990#(< ~counter~0 9)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {37759#true} is VALID [2022-04-08 00:51:51,696 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {37759#true} {37990#(< ~counter~0 9)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {37990#(< ~counter~0 9)} is VALID [2022-04-08 00:51:51,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {37759#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {37759#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {37759#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37759#true} is VALID [2022-04-08 00:51:51,696 INFO L272 TraceCheckUtils]: 32: Hoare triple {37990#(< ~counter~0 9)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {37759#true} is VALID [2022-04-08 00:51:51,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {37990#(< ~counter~0 9)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {37990#(< ~counter~0 9)} is VALID [2022-04-08 00:51:51,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {38063#(< ~counter~0 8)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {37990#(< ~counter~0 9)} is VALID [2022-04-08 00:51:51,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {38063#(< ~counter~0 8)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {38063#(< ~counter~0 8)} is VALID [2022-04-08 00:51:51,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {38063#(< ~counter~0 8)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {38063#(< ~counter~0 8)} is VALID [2022-04-08 00:51:51,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {37932#(<= ~counter~0 6)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {38063#(< ~counter~0 8)} is VALID [2022-04-08 00:51:51,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {37932#(<= ~counter~0 6)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {37932#(<= ~counter~0 6)} is VALID [2022-04-08 00:51:51,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {37932#(<= ~counter~0 6)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {37932#(<= ~counter~0 6)} is VALID [2022-04-08 00:51:51,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {37859#(<= ~counter~0 5)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {37932#(<= ~counter~0 6)} is VALID [2022-04-08 00:51:51,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {37859#(<= ~counter~0 5)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {37859#(<= ~counter~0 5)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {37859#(<= ~counter~0 5)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {37849#(<= ~counter~0 4)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {37859#(<= ~counter~0 5)} is VALID [2022-04-08 00:51:51,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {37849#(<= ~counter~0 4)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {37849#(<= ~counter~0 4)} is VALID [2022-04-08 00:51:51,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {37849#(<= ~counter~0 4)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {37849#(<= ~counter~0 4)} is VALID [2022-04-08 00:51:51,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {37839#(<= ~counter~0 3)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {37849#(<= ~counter~0 4)} is VALID [2022-04-08 00:51:51,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {37839#(<= ~counter~0 3)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {37839#(<= ~counter~0 3)} is VALID [2022-04-08 00:51:51,705 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37759#true} {37839#(<= ~counter~0 3)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {37839#(<= ~counter~0 3)} is VALID [2022-04-08 00:51:51,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {37759#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {37759#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {37759#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37759#true} is VALID [2022-04-08 00:51:51,706 INFO L272 TraceCheckUtils]: 11: Hoare triple {37839#(<= ~counter~0 3)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {37759#true} is VALID [2022-04-08 00:51:51,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37759#true} {37839#(<= ~counter~0 3)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {37839#(<= ~counter~0 3)} is VALID [2022-04-08 00:51:51,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {37759#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {37759#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {37759#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37759#true} is VALID [2022-04-08 00:51:51,707 INFO L272 TraceCheckUtils]: 6: Hoare triple {37839#(<= ~counter~0 3)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {37759#true} is VALID [2022-04-08 00:51:51,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {37839#(<= ~counter~0 3)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {37839#(<= ~counter~0 3)} is VALID [2022-04-08 00:51:51,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {37839#(<= ~counter~0 3)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37839#(<= ~counter~0 3)} is VALID [2022-04-08 00:51:51,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37839#(<= ~counter~0 3)} {37759#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37839#(<= ~counter~0 3)} is VALID [2022-04-08 00:51:51,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {37839#(<= ~counter~0 3)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37839#(<= ~counter~0 3)} is VALID [2022-04-08 00:51:51,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {37759#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {37839#(<= ~counter~0 3)} is VALID [2022-04-08 00:51:51,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {37759#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37759#true} is VALID [2022-04-08 00:51:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 00:51:51,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:51:51,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826485130] [2022-04-08 00:51:51,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:51:51,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582136299] [2022-04-08 00:51:51,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582136299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:51:51,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:51:51,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 00:51:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073692717] [2022-04-08 00:51:51,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:51:51,712 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 64 [2022-04-08 00:51:51,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:51:51,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 00:51:51,803 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 00:51:51,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 00:51:51,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:51:51,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 00:51:51,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 00:51:51,804 INFO L87 Difference]: Start difference. First operand 1226 states and 1707 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 00:51:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:51:54,666 INFO L93 Difference]: Finished difference Result 1314 states and 1800 transitions. [2022-04-08 00:51:54,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 00:51:54,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 64 [2022-04-08 00:51:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:51:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 00:51:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 244 transitions. [2022-04-08 00:51:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 00:51:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 244 transitions. [2022-04-08 00:51:54,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 244 transitions. [2022-04-08 00:51:54,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:51:54,972 INFO L225 Difference]: With dead ends: 1314 [2022-04-08 00:51:54,973 INFO L226 Difference]: Without dead ends: 1292 [2022-04-08 00:51:54,973 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2022-04-08 00:51:54,974 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 185 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 00:51:54,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 387 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 00:51:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-04-08 00:51:57,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1255. [2022-04-08 00:51:57,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:51:57,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1292 states. Second operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:51:57,175 INFO L74 IsIncluded]: Start isIncluded. First operand 1292 states. Second operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:51:57,176 INFO L87 Difference]: Start difference. First operand 1292 states. Second operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:51:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:51:57,254 INFO L93 Difference]: Finished difference Result 1292 states and 1758 transitions. [2022-04-08 00:51:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1758 transitions. [2022-04-08 00:51:57,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:51:57,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:51:57,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1292 states. [2022-04-08 00:51:57,261 INFO L87 Difference]: Start difference. First operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1292 states. [2022-04-08 00:51:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:51:57,346 INFO L93 Difference]: Finished difference Result 1292 states and 1758 transitions. [2022-04-08 00:51:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1758 transitions. [2022-04-08 00:51:57,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:51:57,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:51:57,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:51:57,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:51:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 875 states have (on average 1.2765714285714285) internal successors, (1117), 893 states have internal predecessors, (1117), 307 states have call successors, (307), 73 states have call predecessors, (307), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:51:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1727 transitions. [2022-04-08 00:51:57,450 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1727 transitions. Word has length 64 [2022-04-08 00:51:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:51:57,450 INFO L478 AbstractCegarLoop]: Abstraction has 1255 states and 1727 transitions. [2022-04-08 00:51:57,450 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 00:51:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1727 transitions. [2022-04-08 00:51:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 00:51:57,451 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:51:57,451 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:51:57,478 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 00:51:57,678 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 00:51:57,678 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:51:57,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:51:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash -934249537, now seen corresponding path program 1 times [2022-04-08 00:51:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:51:57,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305135851] [2022-04-08 00:51:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:51:57,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:51:57,694 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:51:57,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946010044] [2022-04-08 00:51:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:51:57,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:51:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:51:57,697 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 00:51:57,699 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 00:51:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:51:57,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 00:51:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:51:57,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:51:58,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {44513#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {44513#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {44513#true} is VALID [2022-04-08 00:51:58,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {44513#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44513#true} {44513#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {44513#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {44513#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44513#true} is VALID [2022-04-08 00:51:58,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {44513#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {44513#true} is VALID [2022-04-08 00:51:58,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {44513#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {44513#true} is VALID [2022-04-08 00:51:58,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {44513#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {44513#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44513#true} {44513#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {44513#true} is VALID [2022-04-08 00:51:58,096 INFO L272 TraceCheckUtils]: 11: Hoare triple {44513#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {44513#true} is VALID [2022-04-08 00:51:58,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {44513#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {44554#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:51:58,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {44554#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {44558#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:51:58,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {44558#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44558#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:51:58,098 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44558#(not (= |assume_abort_if_not_#in~cond| 0))} {44513#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {44565#(<= 1 main_~y~0)} is VALID [2022-04-08 00:51:58,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {44565#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44569#(<= 1 main_~b~0)} is VALID [2022-04-08 00:51:58,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {44569#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {44569#(<= 1 main_~b~0)} is VALID [2022-04-08 00:51:58,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {44569#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {44569#(<= 1 main_~b~0)} is VALID [2022-04-08 00:51:58,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {44569#(<= 1 main_~b~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {44569#(<= 1 main_~b~0)} is VALID [2022-04-08 00:51:58,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {44569#(<= 1 main_~b~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {44569#(<= 1 main_~b~0)} is VALID [2022-04-08 00:51:58,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {44569#(<= 1 main_~b~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {44569#(<= 1 main_~b~0)} is VALID [2022-04-08 00:51:58,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {44569#(<= 1 main_~b~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,101 INFO L272 TraceCheckUtils]: 25: Hoare triple {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {44513#true} is VALID [2022-04-08 00:51:58,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,102 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {44513#true} {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,102 INFO L272 TraceCheckUtils]: 30: Hoare triple {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {44513#true} is VALID [2022-04-08 00:51:58,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,103 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {44513#true} {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,104 INFO L272 TraceCheckUtils]: 35: Hoare triple {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {44513#true} is VALID [2022-04-08 00:51:58,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,105 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {44513#true} {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,105 INFO L272 TraceCheckUtils]: 40: Hoare triple {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {44513#true} is VALID [2022-04-08 00:51:58,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,106 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44513#true} {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {44588#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} [150] L52-->L48-3: Formula: (let ((.cse0 (* v_main_~v~0_7 2))) (and (<= .cse0 v_main_~c~0_10) (= v_main_~v~0_6 .cse0) (= v_main_~d~0_5 (* v_main_~d~0_6 2)))) InVars {main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_7, main_~d~0=v_main_~d~0_6} OutVars{main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_6, main_~d~0=v_main_~d~0_5} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,107 INFO L272 TraceCheckUtils]: 48: Hoare triple {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {44513#true} is VALID [2022-04-08 00:51:58,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,108 INFO L290 TraceCheckUtils]: 51: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,108 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {44513#true} {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,108 INFO L272 TraceCheckUtils]: 53: Hoare triple {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {44513#true} is VALID [2022-04-08 00:51:58,109 INFO L290 TraceCheckUtils]: 54: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,109 INFO L290 TraceCheckUtils]: 55: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,109 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {44513#true} {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,110 INFO L272 TraceCheckUtils]: 58: Hoare triple {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {44513#true} is VALID [2022-04-08 00:51:58,110 INFO L290 TraceCheckUtils]: 59: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,110 INFO L290 TraceCheckUtils]: 60: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,110 INFO L290 TraceCheckUtils]: 61: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,111 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {44513#true} {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-08 00:51:58,111 INFO L272 TraceCheckUtils]: 63: Hoare triple {44658#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {44713#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:51:58,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {44713#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44717#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:51:58,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {44717#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {44514#false} is VALID [2022-04-08 00:51:58,112 INFO L290 TraceCheckUtils]: 66: Hoare triple {44514#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44514#false} is VALID [2022-04-08 00:51:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-04-08 00:51:58,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:51:58,365 INFO L290 TraceCheckUtils]: 66: Hoare triple {44514#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44514#false} is VALID [2022-04-08 00:51:58,366 INFO L290 TraceCheckUtils]: 65: Hoare triple {44717#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {44514#false} is VALID [2022-04-08 00:51:58,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {44713#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44717#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:51:58,367 INFO L272 TraceCheckUtils]: 63: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {44713#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:51:58,368 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {44513#true} {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,368 INFO L290 TraceCheckUtils]: 60: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,368 INFO L290 TraceCheckUtils]: 59: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,368 INFO L272 TraceCheckUtils]: 58: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {44513#true} is VALID [2022-04-08 00:51:58,369 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {44513#true} {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,370 INFO L272 TraceCheckUtils]: 53: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {44513#true} is VALID [2022-04-08 00:51:58,370 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {44513#true} {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,371 INFO L272 TraceCheckUtils]: 48: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {44513#true} is VALID [2022-04-08 00:51:58,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,372 INFO L290 TraceCheckUtils]: 46: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [150] L52-->L48-3: Formula: (let ((.cse0 (* v_main_~v~0_7 2))) (and (<= .cse0 v_main_~c~0_10) (= v_main_~v~0_6 .cse0) (= v_main_~d~0_5 (* v_main_~d~0_6 2)))) InVars {main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_7, main_~d~0=v_main_~d~0_6} OutVars{main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_6, main_~d~0=v_main_~d~0_5} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,374 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {44513#true} {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,375 INFO L272 TraceCheckUtils]: 40: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {44513#true} is VALID [2022-04-08 00:51:58,375 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {44513#true} {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,376 INFO L272 TraceCheckUtils]: 35: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {44513#true} is VALID [2022-04-08 00:51:58,377 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {44513#true} {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,377 INFO L272 TraceCheckUtils]: 30: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {44513#true} is VALID [2022-04-08 00:51:58,378 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {44513#true} {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {44513#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {44513#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {44513#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44513#true} is VALID [2022-04-08 00:51:58,378 INFO L272 TraceCheckUtils]: 25: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {44513#true} is VALID [2022-04-08 00:51:58,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {44513#true} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {44733#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-08 00:51:58,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {44513#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {44513#true} is VALID [2022-04-08 00:51:58,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {44513#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {44513#true} is VALID [2022-04-08 00:51:58,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {44513#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {44513#true} is VALID [2022-04-08 00:51:58,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {44513#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {44513#true} is VALID [2022-04-08 00:51:58,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {44513#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {44513#true} is VALID [2022-04-08 00:51:58,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {44513#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44513#true} is VALID [2022-04-08 00:51:58,380 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44513#true} {44513#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {44513#true} is VALID [2022-04-08 00:51:58,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {44513#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {44513#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {44513#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {44513#true} is VALID [2022-04-08 00:51:58,381 INFO L272 TraceCheckUtils]: 11: Hoare triple {44513#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {44513#true} is VALID [2022-04-08 00:51:58,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44513#true} {44513#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {44513#true} is VALID [2022-04-08 00:51:58,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {44513#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {44513#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {44513#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {44513#true} is VALID [2022-04-08 00:51:58,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {44513#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {44513#true} is VALID [2022-04-08 00:51:58,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {44513#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44513#true} is VALID [2022-04-08 00:51:58,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {44513#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44513#true} {44513#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {44513#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {44513#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {44513#true} is VALID [2022-04-08 00:51:58,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {44513#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44513#true} is VALID [2022-04-08 00:51:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-08 00:51:58,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:51:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305135851] [2022-04-08 00:51:58,383 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:51:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946010044] [2022-04-08 00:51:58,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946010044] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 00:51:58,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 00:51:58,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-08 00:51:58,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103619425] [2022-04-08 00:51:58,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:51:58,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-04-08 00:51:58,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:51:58,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 00:51:58,417 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 00:51:58,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 00:51:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:51:58,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 00:51:58,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-08 00:51:58,418 INFO L87 Difference]: Start difference. First operand 1255 states and 1727 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 00:52:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:52:00,817 INFO L93 Difference]: Finished difference Result 1285 states and 1756 transitions. [2022-04-08 00:52:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 00:52:00,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-04-08 00:52:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:52:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 00:52:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-08 00:52:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 00:52:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-08 00:52:00,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-08 00:52:00,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:52:00,932 INFO L225 Difference]: With dead ends: 1285 [2022-04-08 00:52:00,932 INFO L226 Difference]: Without dead ends: 1283 [2022-04-08 00:52:00,933 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-08 00:52:00,933 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 00:52:00,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 00:52:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-04-08 00:52:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1275. [2022-04-08 00:52:03,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:52:03,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1283 states. Second operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:52:03,028 INFO L74 IsIncluded]: Start isIncluded. First operand 1283 states. Second operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:52:03,030 INFO L87 Difference]: Start difference. First operand 1283 states. Second operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:52:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:52:03,103 INFO L93 Difference]: Finished difference Result 1283 states and 1748 transitions. [2022-04-08 00:52:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1748 transitions. [2022-04-08 00:52:03,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:52:03,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:52:03,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1283 states. [2022-04-08 00:52:03,110 INFO L87 Difference]: Start difference. First operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1283 states. [2022-04-08 00:52:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:52:03,178 INFO L93 Difference]: Finished difference Result 1283 states and 1748 transitions. [2022-04-08 00:52:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1748 transitions. [2022-04-08 00:52:03,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:52:03,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:52:03,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:52:03,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:52:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 890 states have (on average 1.2696629213483146) internal successors, (1130), 908 states have internal predecessors, (1130), 307 states have call successors, (307), 78 states have call predecessors, (307), 77 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-08 00:52:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1740 transitions. [2022-04-08 00:52:03,281 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1740 transitions. Word has length 67 [2022-04-08 00:52:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:52:03,281 INFO L478 AbstractCegarLoop]: Abstraction has 1275 states and 1740 transitions. [2022-04-08 00:52:03,282 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 00:52:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1740 transitions. [2022-04-08 00:52:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 00:52:03,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:52:03,285 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:52:03,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 00:52:03,503 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 00:52:03,503 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:52:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:52:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1422612783, now seen corresponding path program 1 times [2022-04-08 00:52:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:52:03,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163076467] [2022-04-08 00:52:03,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:52:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:52:03,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:52:03,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425890615] [2022-04-08 00:52:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:52:03,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:52:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:52:03,521 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 00:52:03,530 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 00:52:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:52:03,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 00:52:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:52:03,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:52:03,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {51233#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {51233#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {51233#true} is VALID [2022-04-08 00:52:03,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {51233#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51233#true} {51233#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {51233#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {51233#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {51233#true} is VALID [2022-04-08 00:52:03,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {51233#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {51233#true} is VALID [2022-04-08 00:52:03,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {51233#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {51233#true} is VALID [2022-04-08 00:52:03,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {51233#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {51233#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,801 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51233#true} {51233#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {51233#true} is VALID [2022-04-08 00:52:03,801 INFO L272 TraceCheckUtils]: 11: Hoare triple {51233#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {51233#true} is VALID [2022-04-08 00:52:03,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {51233#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {51233#true} is VALID [2022-04-08 00:52:03,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {51233#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {51233#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,802 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51233#true} {51233#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {51233#true} is VALID [2022-04-08 00:52:03,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {51233#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {51233#true} is VALID [2022-04-08 00:52:03,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {51233#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {51233#true} is VALID [2022-04-08 00:52:03,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {51233#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {51233#true} is VALID [2022-04-08 00:52:03,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {51233#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {51233#true} is VALID [2022-04-08 00:52:03,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {51233#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {51233#true} is VALID [2022-04-08 00:52:03,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {51233#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {51233#true} is VALID [2022-04-08 00:52:03,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {51233#true} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {51233#true} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {51233#true} is VALID [2022-04-08 00:52:03,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {51233#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {51233#true} is VALID [2022-04-08 00:52:03,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {51233#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {51233#true} is VALID [2022-04-08 00:52:03,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {51233#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {51233#true} is VALID [2022-04-08 00:52:03,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {51233#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {51233#true} is VALID [2022-04-08 00:52:03,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {51233#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {51233#true} is VALID [2022-04-08 00:52:03,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {51233#true} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {51325#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 00:52:03,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {51325#(<= main_~v~0 main_~b~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {51325#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 00:52:03,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {51325#(<= main_~v~0 main_~b~0)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {51325#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 00:52:03,805 INFO L272 TraceCheckUtils]: 32: Hoare triple {51325#(<= main_~v~0 main_~b~0)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {51233#true} is VALID [2022-04-08 00:52:03,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {51233#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {51233#true} is VALID [2022-04-08 00:52:03,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {51233#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {51233#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,806 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {51233#true} {51325#(<= main_~v~0 main_~b~0)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {51325#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 00:52:03,806 INFO L272 TraceCheckUtils]: 37: Hoare triple {51325#(<= main_~v~0 main_~b~0)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {51233#true} is VALID [2022-04-08 00:52:03,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {51233#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {51233#true} is VALID [2022-04-08 00:52:03,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {51233#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {51233#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,807 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {51233#true} {51325#(<= main_~v~0 main_~b~0)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {51325#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 00:52:03,807 INFO L272 TraceCheckUtils]: 42: Hoare triple {51325#(<= main_~v~0 main_~b~0)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {51233#true} is VALID [2022-04-08 00:52:03,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {51233#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {51233#true} is VALID [2022-04-08 00:52:03,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {51233#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {51233#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,808 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {51233#true} {51325#(<= main_~v~0 main_~b~0)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {51325#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 00:52:03,808 INFO L272 TraceCheckUtils]: 47: Hoare triple {51325#(<= main_~v~0 main_~b~0)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {51233#true} is VALID [2022-04-08 00:52:03,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {51233#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {51233#true} is VALID [2022-04-08 00:52:03,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {51233#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {51233#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51233#true} is VALID [2022-04-08 00:52:03,809 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {51233#true} {51325#(<= main_~v~0 main_~b~0)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {51325#(<= main_~v~0 main_~b~0)} is VALID [2022-04-08 00:52:03,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {51325#(<= main_~v~0 main_~b~0)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {51395#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-08 00:52:03,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {51395#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {51399#(< main_~c~0 main_~b~0)} is VALID [2022-04-08 00:52:03,811 INFO L290 TraceCheckUtils]: 54: Hoare triple {51399#(< main_~c~0 main_~b~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {51399#(< main_~c~0 main_~b~0)} is VALID [2022-04-08 00:52:03,811 INFO L290 TraceCheckUtils]: 55: Hoare triple {51399#(< main_~c~0 main_~b~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {51399#(< main_~c~0 main_~b~0)} is VALID [2022-04-08 00:52:03,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {51399#(< main_~c~0 main_~b~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {51234#false} is VALID [2022-04-08 00:52:03,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {51234#false} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {51234#false} is VALID [2022-04-08 00:52:03,812 INFO L290 TraceCheckUtils]: 58: Hoare triple {51234#false} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {51234#false} is VALID [2022-04-08 00:52:03,812 INFO L272 TraceCheckUtils]: 59: Hoare triple {51234#false} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {51234#false} is VALID [2022-04-08 00:52:03,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {51234#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {51234#false} is VALID [2022-04-08 00:52:03,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {51234#false} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {51234#false} is VALID [2022-04-08 00:52:03,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {51234#false} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51234#false} is VALID [2022-04-08 00:52:03,812 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51234#false} {51234#false} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {51234#false} is VALID [2022-04-08 00:52:03,812 INFO L272 TraceCheckUtils]: 64: Hoare triple {51234#false} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {51234#false} is VALID [2022-04-08 00:52:03,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {51234#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {51234#false} is VALID [2022-04-08 00:52:03,813 INFO L290 TraceCheckUtils]: 66: Hoare triple {51234#false} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {51234#false} is VALID [2022-04-08 00:52:03,813 INFO L290 TraceCheckUtils]: 67: Hoare triple {51234#false} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51234#false} is VALID [2022-04-08 00:52:03,813 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {51234#false} {51234#false} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {51234#false} is VALID [2022-04-08 00:52:03,813 INFO L272 TraceCheckUtils]: 69: Hoare triple {51234#false} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {51234#false} is VALID [2022-04-08 00:52:03,813 INFO L290 TraceCheckUtils]: 70: Hoare triple {51234#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {51234#false} is VALID [2022-04-08 00:52:03,813 INFO L290 TraceCheckUtils]: 71: Hoare triple {51234#false} [134] L11-->L12: 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[] {51234#false} is VALID [2022-04-08 00:52:03,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {51234#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51234#false} is VALID [2022-04-08 00:52:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 00:52:03,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 00:52:03,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:52:03,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163076467] [2022-04-08 00:52:03,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:52:03,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425890615] [2022-04-08 00:52:03,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425890615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 00:52:03,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 00:52:03,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 00:52:03,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317390647] [2022-04-08 00:52:03,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 00:52:03,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-04-08 00:52:03,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:52:03,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 00:52:03,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:52:03,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 00:52:03,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:52:03,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 00:52:03,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 00:52:03,858 INFO L87 Difference]: Start difference. First operand 1275 states and 1740 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 00:52:06,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:52:06,347 INFO L93 Difference]: Finished difference Result 2192 states and 3032 transitions. [2022-04-08 00:52:06,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 00:52:06,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-04-08 00:52:06,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:52:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 00:52:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-08 00:52:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 00:52:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-08 00:52:06,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-04-08 00:52:06,434 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 00:52:06,503 INFO L225 Difference]: With dead ends: 2192 [2022-04-08 00:52:06,504 INFO L226 Difference]: Without dead ends: 1325 [2022-04-08 00:52:06,506 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 00:52:06,506 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 00:52:06,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 00:52:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-04-08 00:52:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1232. [2022-04-08 00:52:08,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:52:08,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1325 states. Second operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) [2022-04-08 00:52:08,500 INFO L74 IsIncluded]: Start isIncluded. First operand 1325 states. Second operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) [2022-04-08 00:52:08,501 INFO L87 Difference]: Start difference. First operand 1325 states. Second operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) [2022-04-08 00:52:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:52:08,577 INFO L93 Difference]: Finished difference Result 1325 states and 1781 transitions. [2022-04-08 00:52:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1781 transitions. [2022-04-08 00:52:08,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:52:08,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:52:08,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) Second operand 1325 states. [2022-04-08 00:52:08,584 INFO L87 Difference]: Start difference. First operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) Second operand 1325 states. [2022-04-08 00:52:08,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:52:08,659 INFO L93 Difference]: Finished difference Result 1325 states and 1781 transitions. [2022-04-08 00:52:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1781 transitions. [2022-04-08 00:52:08,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:52:08,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:52:08,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:52:08,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:52:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 885 states have (on average 1.2677966101694915) internal successors, (1122), 888 states have internal predecessors, (1122), 271 states have call successors, (271), 76 states have call predecessors, (271), 75 states have return successors, (267), 267 states have call predecessors, (267), 267 states have call successors, (267) [2022-04-08 00:52:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1660 transitions. [2022-04-08 00:52:08,754 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1660 transitions. Word has length 73 [2022-04-08 00:52:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:52:08,754 INFO L478 AbstractCegarLoop]: Abstraction has 1232 states and 1660 transitions. [2022-04-08 00:52:08,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 00:52:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1660 transitions. [2022-04-08 00:52:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 00:52:08,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:52:08,756 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:52:08,782 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 00:52:08,971 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 00:52:08,971 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:52:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:52:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1662269742, now seen corresponding path program 2 times [2022-04-08 00:52:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:52:08,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115137641] [2022-04-08 00:52:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:52:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:52:08,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:52:08,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919146590] [2022-04-08 00:52:08,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 00:52:08,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:52:08,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:52:08,998 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 00:52:09,025 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 00:52:09,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 00:52:09,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 00:52:09,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 82 conjunts are in the unsatisfiable core [2022-04-08 00:52:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:52:09,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:52:11,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {59040#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {59040#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {59040#true} is VALID [2022-04-08 00:52:11,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {59040#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59040#true} {59040#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {59040#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {59040#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {59040#true} is VALID [2022-04-08 00:52:11,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {59040#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {59040#true} is VALID [2022-04-08 00:52:11,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {59040#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {59040#true} is VALID [2022-04-08 00:52:11,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {59040#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {59040#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,038 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {59040#true} {59040#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {59040#true} is VALID [2022-04-08 00:52:11,039 INFO L272 TraceCheckUtils]: 11: Hoare triple {59040#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {59040#true} is VALID [2022-04-08 00:52:11,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {59040#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {59081#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 00:52:11,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {59081#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {59085#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:52:11,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {59085#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59085#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 00:52:11,048 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {59085#(not (= |assume_abort_if_not_#in~cond| 0))} {59040#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {59092#(<= 1 main_~y~0)} is VALID [2022-04-08 00:52:11,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {59092#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {59096#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {59096#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {59096#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {59096#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {59096#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {59096#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {59106#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {59106#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {59106#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {59106#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {59106#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {59106#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {59116#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {59116#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {59120#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-08 00:52:11,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {59120#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {59120#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-08 00:52:11,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {59120#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {59120#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-08 00:52:11,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {59120#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {59130#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-08 00:52:11,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {59130#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {59130#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-08 00:52:11,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {59130#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {59130#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-08 00:52:11,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {59130#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {59140#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-08 00:52:11,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {59140#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {59140#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-08 00:52:11,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {59140#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {59140#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-08 00:52:11,058 INFO L272 TraceCheckUtils]: 32: Hoare triple {59140#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {59040#true} is VALID [2022-04-08 00:52:11,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {59040#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59153#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:52:11,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {59153#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:52:11,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:52:11,061 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} {59140#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {59164#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:52:11,061 INFO L272 TraceCheckUtils]: 37: Hoare triple {59164#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {59040#true} is VALID [2022-04-08 00:52:11,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {59040#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59040#true} is VALID [2022-04-08 00:52:11,061 INFO L290 TraceCheckUtils]: 39: Hoare triple {59040#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {59040#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,062 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {59040#true} {59164#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {59164#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:52:11,062 INFO L272 TraceCheckUtils]: 42: Hoare triple {59164#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {59040#true} is VALID [2022-04-08 00:52:11,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {59040#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59040#true} is VALID [2022-04-08 00:52:11,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {59040#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {59040#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,063 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {59040#true} {59164#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {59164#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:52:11,064 INFO L272 TraceCheckUtils]: 47: Hoare triple {59164#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {59040#true} is VALID [2022-04-08 00:52:11,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {59040#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59040#true} is VALID [2022-04-08 00:52:11,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {59040#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {59040#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:52:11,065 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {59040#true} {59164#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {59164#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:52:11,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {59164#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {59213#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (< main_~c~0 (* main_~v~0 2)) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:52:11,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {59213#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (< main_~c~0 (* main_~v~0 2)) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {59217#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:52:11,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {59217#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {59217#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:52:11,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {59217#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {59217#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:52:11,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {59217#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {59217#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:52:11,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {59217#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,074 INFO L290 TraceCheckUtils]: 60: Hoare triple {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,075 INFO L290 TraceCheckUtils]: 63: Hoare triple {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,076 INFO L290 TraceCheckUtils]: 64: Hoare triple {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,077 INFO L290 TraceCheckUtils]: 65: Hoare triple {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-08 00:52:11,077 INFO L272 TraceCheckUtils]: 66: Hoare triple {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {59040#true} is VALID [2022-04-08 00:52:11,077 INFO L290 TraceCheckUtils]: 67: Hoare triple {59040#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59153#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:52:11,078 INFO L290 TraceCheckUtils]: 68: Hoare triple {59153#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:52:11,078 INFO L290 TraceCheckUtils]: 69: Hoare triple {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:52:11,079 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} {59230#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {59270#(and (< (* main_~b~0 2) main_~y~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} is VALID [2022-04-08 00:52:11,080 INFO L272 TraceCheckUtils]: 71: Hoare triple {59270#(and (< (* main_~b~0 2) main_~y~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {59274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:52:11,081 INFO L290 TraceCheckUtils]: 72: Hoare triple {59274#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:52:11,081 INFO L290 TraceCheckUtils]: 73: Hoare triple {59278#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {59041#false} is VALID [2022-04-08 00:52:11,081 INFO L290 TraceCheckUtils]: 74: Hoare triple {59041#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59041#false} is VALID [2022-04-08 00:52:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 43 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 00:52:11,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:53:09,211 INFO L290 TraceCheckUtils]: 74: Hoare triple {59041#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59041#false} is VALID [2022-04-08 00:53:09,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {59278#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {59041#false} is VALID [2022-04-08 00:53:09,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {59274#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:53:09,212 INFO L272 TraceCheckUtils]: 71: Hoare triple {59294#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {59274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:53:09,213 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {59294#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 00:53:09,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:53:09,214 INFO L290 TraceCheckUtils]: 68: Hoare triple {59308#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:53:09,214 INFO L290 TraceCheckUtils]: 67: Hoare triple {59040#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59308#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:53:09,214 INFO L272 TraceCheckUtils]: 66: Hoare triple {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {59040#true} is VALID [2022-04-08 00:53:09,214 INFO L290 TraceCheckUtils]: 65: Hoare triple {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:53:09,215 INFO L290 TraceCheckUtils]: 64: Hoare triple {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:53:09,215 INFO L290 TraceCheckUtils]: 63: Hoare triple {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:53:09,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:53:09,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:53:09,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:53:09,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:53:09,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:53:09,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {59339#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {59298#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-08 00:53:09,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {59339#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {59339#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {59339#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {59339#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {59339#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {59339#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,240 INFO L290 TraceCheckUtils]: 53: Hoare triple {59352#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {59339#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,241 INFO L290 TraceCheckUtils]: 52: Hoare triple {59356#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {59352#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,242 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {59040#true} {59356#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {59356#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {59040#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,242 INFO L290 TraceCheckUtils]: 49: Hoare triple {59040#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,242 INFO L290 TraceCheckUtils]: 48: Hoare triple {59040#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59040#true} is VALID [2022-04-08 00:53:09,242 INFO L272 TraceCheckUtils]: 47: Hoare triple {59356#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {59040#true} is VALID [2022-04-08 00:53:09,243 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {59040#true} {59356#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {59356#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {59040#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {59040#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {59040#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59040#true} is VALID [2022-04-08 00:53:09,243 INFO L272 TraceCheckUtils]: 42: Hoare triple {59356#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {59040#true} is VALID [2022-04-08 00:53:09,244 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {59040#true} {59356#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {59356#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {59040#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {59040#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {59040#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59040#true} is VALID [2022-04-08 00:53:09,245 INFO L272 TraceCheckUtils]: 37: Hoare triple {59356#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {59040#true} is VALID [2022-04-08 00:53:09,246 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} {59405#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {59356#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:53:09,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {59308#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {59157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:53:09,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {59040#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {59308#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:53:09,247 INFO L272 TraceCheckUtils]: 32: Hoare triple {59405#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {59040#true} is VALID [2022-04-08 00:53:09,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {59405#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {59405#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {59405#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {59405#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {59427#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {59405#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {59427#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {59427#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {59427#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {59427#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {59040#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {59427#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-08 00:53:09,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {59040#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {59040#true} is VALID [2022-04-08 00:53:09,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {59040#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {59040#true} is VALID [2022-04-08 00:53:09,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {59040#true} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {59040#true} is VALID [2022-04-08 00:53:09,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {59040#true} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {59040#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {59040#true} is VALID [2022-04-08 00:53:09,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {59040#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {59040#true} is VALID [2022-04-08 00:53:09,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {59040#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {59040#true} is VALID [2022-04-08 00:53:09,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {59040#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {59040#true} is VALID [2022-04-08 00:53:09,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {59040#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {59040#true} is VALID [2022-04-08 00:53:09,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {59040#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {59040#true} is VALID [2022-04-08 00:53:09,253 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {59040#true} {59040#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {59040#true} is VALID [2022-04-08 00:53:09,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {59040#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {59040#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {59040#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {59040#true} is VALID [2022-04-08 00:53:09,253 INFO L272 TraceCheckUtils]: 11: Hoare triple {59040#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {59040#true} is VALID [2022-04-08 00:53:09,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {59040#true} {59040#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {59040#true} is VALID [2022-04-08 00:53:09,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {59040#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {59040#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {59040#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {59040#true} is VALID [2022-04-08 00:53:09,254 INFO L272 TraceCheckUtils]: 6: Hoare triple {59040#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {59040#true} is VALID [2022-04-08 00:53:09,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {59040#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {59040#true} is VALID [2022-04-08 00:53:09,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {59040#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59040#true} {59040#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {59040#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {59040#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {59040#true} is VALID [2022-04-08 00:53:09,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {59040#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59040#true} is VALID [2022-04-08 00:53:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 00:53:09,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:53:09,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115137641] [2022-04-08 00:53:09,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:53:09,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919146590] [2022-04-08 00:53:09,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919146590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:53:09,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:53:09,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2022-04-08 00:53:09,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767156780] [2022-04-08 00:53:09,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:53:09,257 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 75 [2022-04-08 00:53:09,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:53:09,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 00:53:09,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:53:09,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 00:53:09,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:53:09,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 00:53:09,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-04-08 00:53:09,602 INFO L87 Difference]: Start difference. First operand 1232 states and 1660 transitions. Second operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 00:53:26,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 00:53:28,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 00:53:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:53:39,930 INFO L93 Difference]: Finished difference Result 1475 states and 1968 transitions. [2022-04-08 00:53:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 00:53:39,930 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 75 [2022-04-08 00:53:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:53:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 00:53:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 242 transitions. [2022-04-08 00:53:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 00:53:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 242 transitions. [2022-04-08 00:53:39,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 242 transitions. [2022-04-08 00:53:40,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:53:40,752 INFO L225 Difference]: With dead ends: 1475 [2022-04-08 00:53:40,752 INFO L226 Difference]: Without dead ends: 1469 [2022-04-08 00:53:40,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=469, Invalid=1981, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 00:53:40,753 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 317 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 338 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-04-08 00:53:40,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 544 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 1052 Invalid, 1 Unknown, 0 Unchecked, 11.7s Time] [2022-04-08 00:53:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-04-08 00:53:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1416. [2022-04-08 00:53:43,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:53:43,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1469 states. Second operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) [2022-04-08 00:53:43,124 INFO L74 IsIncluded]: Start isIncluded. First operand 1469 states. Second operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) [2022-04-08 00:53:43,126 INFO L87 Difference]: Start difference. First operand 1469 states. Second operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) [2022-04-08 00:53:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:53:43,217 INFO L93 Difference]: Finished difference Result 1469 states and 1958 transitions. [2022-04-08 00:53:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1958 transitions. [2022-04-08 00:53:43,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:53:43,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:53:43,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) Second operand 1469 states. [2022-04-08 00:53:43,223 INFO L87 Difference]: Start difference. First operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) Second operand 1469 states. [2022-04-08 00:53:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:53:43,330 INFO L93 Difference]: Finished difference Result 1469 states and 1958 transitions. [2022-04-08 00:53:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1958 transitions. [2022-04-08 00:53:43,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:53:43,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:53:43,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:53:43,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:53:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1028 states have (on average 1.2752918287937742) internal successors, (1311), 1037 states have internal predecessors, (1311), 298 states have call successors, (298), 91 states have call predecessors, (298), 89 states have return successors, (295), 287 states have call predecessors, (295), 295 states have call successors, (295) [2022-04-08 00:53:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1904 transitions. [2022-04-08 00:53:43,452 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1904 transitions. Word has length 75 [2022-04-08 00:53:43,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:53:43,452 INFO L478 AbstractCegarLoop]: Abstraction has 1416 states and 1904 transitions. [2022-04-08 00:53:43,453 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 00:53:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1904 transitions. [2022-04-08 00:53:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-08 00:53:43,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:53:43,455 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:53:43,477 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 00:53:43,674 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 00:53:43,675 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:53:43,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:53:43,675 INFO L85 PathProgramCache]: Analyzing trace with hash 612727057, now seen corresponding path program 1 times [2022-04-08 00:53:43,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:53:43,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576565913] [2022-04-08 00:53:43,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:53:43,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:53:43,689 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:53:43,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782547878] [2022-04-08 00:53:43,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:53:43,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:53:43,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:53:43,691 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 00:53:43,695 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 00:53:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:53:43,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjunts are in the unsatisfiable core [2022-04-08 00:53:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:53:43,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:53:46,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {66640#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {66640#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {66640#true} is VALID [2022-04-08 00:53:46,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {66640#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66640#true} {66640#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {66640#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {66640#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:53:46,175 INFO L272 TraceCheckUtils]: 6: Hoare triple {66640#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {66640#true} is VALID [2022-04-08 00:53:46,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {66640#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {66640#true} is VALID [2022-04-08 00:53:46,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {66640#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {66640#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66640#true} {66640#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {66640#true} is VALID [2022-04-08 00:53:46,175 INFO L272 TraceCheckUtils]: 11: Hoare triple {66640#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {66640#true} is VALID [2022-04-08 00:53:46,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {66640#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {66640#true} is VALID [2022-04-08 00:53:46,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {66640#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {66640#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,175 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66640#true} {66640#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {66640#true} is VALID [2022-04-08 00:53:46,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {66640#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {66693#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 00:53:46,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {66693#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {66693#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 00:53:46,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {66693#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {66693#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 00:53:46,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {66693#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {66703#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 00:53:46,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {66703#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {66703#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 00:53:46,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {66703#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {66703#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 00:53:46,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {66703#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {66713#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 00:53:46,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {66713#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {66717#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 00:53:46,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {66717#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {66717#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 00:53:46,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {66717#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {66717#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 00:53:46,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {66717#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {66727#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 00:53:46,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {66727#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {66727#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 00:53:46,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {66727#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {66727#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 00:53:46,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {66727#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-08 00:53:46,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-08 00:53:46,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-08 00:53:46,185 INFO L272 TraceCheckUtils]: 32: Hoare triple {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:53:46,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66640#true} is VALID [2022-04-08 00:53:46,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {66640#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {66640#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,187 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {66640#true} {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-08 00:53:46,187 INFO L272 TraceCheckUtils]: 37: Hoare triple {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {66640#true} is VALID [2022-04-08 00:53:46,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66640#true} is VALID [2022-04-08 00:53:46,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {66640#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {66640#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,188 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {66640#true} {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-08 00:53:46,188 INFO L272 TraceCheckUtils]: 42: Hoare triple {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:53:46,189 INFO L290 TraceCheckUtils]: 43: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66640#true} is VALID [2022-04-08 00:53:46,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {66640#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {66640#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,190 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {66640#true} {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-08 00:53:46,190 INFO L272 TraceCheckUtils]: 47: Hoare triple {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {66640#true} is VALID [2022-04-08 00:53:46,190 INFO L290 TraceCheckUtils]: 48: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66640#true} is VALID [2022-04-08 00:53:46,190 INFO L290 TraceCheckUtils]: 49: Hoare triple {66640#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,190 INFO L290 TraceCheckUtils]: 50: Hoare triple {66640#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,195 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {66640#true} {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-08 00:53:46,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {66737#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} [150] L52-->L48-3: Formula: (let ((.cse0 (* v_main_~v~0_7 2))) (and (<= .cse0 v_main_~c~0_10) (= v_main_~v~0_6 .cse0) (= v_main_~d~0_5 (* v_main_~d~0_6 2)))) InVars {main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_7, main_~d~0=v_main_~d~0_6} OutVars{main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_6, main_~d~0=v_main_~d~0_5} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {66807#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-08 00:53:46,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {66807#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {66807#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-08 00:53:46,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {66807#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {66807#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-08 00:53:46,198 INFO L272 TraceCheckUtils]: 55: Hoare triple {66807#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:53:46,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66820#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:53:46,198 INFO L290 TraceCheckUtils]: 57: Hoare triple {66820#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:53:46,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:53:46,200 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} {66807#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {66831#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:53:46,200 INFO L272 TraceCheckUtils]: 60: Hoare triple {66831#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {66640#true} is VALID [2022-04-08 00:53:46,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66820#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:53:46,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {66820#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:53:46,201 INFO L290 TraceCheckUtils]: 63: Hoare triple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:53:46,202 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} {66831#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {66847#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:53:46,203 INFO L272 TraceCheckUtils]: 65: Hoare triple {66847#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:53:46,203 INFO L290 TraceCheckUtils]: 66: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66640#true} is VALID [2022-04-08 00:53:46,203 INFO L290 TraceCheckUtils]: 67: Hoare triple {66640#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,203 INFO L290 TraceCheckUtils]: 68: Hoare triple {66640#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:53:46,204 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {66640#true} {66847#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {66847#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:53:46,204 INFO L272 TraceCheckUtils]: 70: Hoare triple {66847#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {66640#true} is VALID [2022-04-08 00:53:46,204 INFO L290 TraceCheckUtils]: 71: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66820#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:53:46,205 INFO L290 TraceCheckUtils]: 72: Hoare triple {66820#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:53:46,205 INFO L290 TraceCheckUtils]: 73: Hoare triple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:53:46,206 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} {66847#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {66847#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:53:46,207 INFO L290 TraceCheckUtils]: 75: Hoare triple {66847#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {66847#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:53:46,208 INFO L290 TraceCheckUtils]: 76: Hoare triple {66847#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {66884#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:53:46,209 INFO L290 TraceCheckUtils]: 77: Hoare triple {66884#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {66884#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:53:46,209 INFO L290 TraceCheckUtils]: 78: Hoare triple {66884#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {66884#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:53:46,210 INFO L290 TraceCheckUtils]: 79: Hoare triple {66884#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {66894#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (< main_~c~0 main_~b~0) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 00:53:46,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {66894#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (< main_~c~0 main_~b~0) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {66898#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-08 00:53:46,213 INFO L290 TraceCheckUtils]: 81: Hoare triple {66898#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {66898#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-08 00:53:46,219 INFO L290 TraceCheckUtils]: 82: Hoare triple {66898#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {66898#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-08 00:53:46,220 INFO L290 TraceCheckUtils]: 83: Hoare triple {66898#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {66908#(and (= main_~r~0 0) (= main_~y~0 (* 2 (* main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-08 00:53:46,222 INFO L272 TraceCheckUtils]: 84: Hoare triple {66908#(and (= main_~r~0 0) (= main_~y~0 (* 2 (* main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {66912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:53:46,223 INFO L290 TraceCheckUtils]: 85: Hoare triple {66912#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:53:46,223 INFO L290 TraceCheckUtils]: 86: Hoare triple {66916#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {66641#false} is VALID [2022-04-08 00:53:46,223 INFO L290 TraceCheckUtils]: 87: Hoare triple {66641#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66641#false} is VALID [2022-04-08 00:53:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 52 proven. 35 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-08 00:53:46,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:54:53,546 INFO L290 TraceCheckUtils]: 87: Hoare triple {66641#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66641#false} is VALID [2022-04-08 00:54:53,547 INFO L290 TraceCheckUtils]: 86: Hoare triple {66916#(<= 1 __VERIFIER_assert_~cond)} [134] L11-->L12: 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[] {66641#false} is VALID [2022-04-08 00:54:53,547 INFO L290 TraceCheckUtils]: 85: Hoare triple {66912#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 00:54:53,548 INFO L272 TraceCheckUtils]: 84: Hoare triple {66932#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {66912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 00:54:53,548 INFO L290 TraceCheckUtils]: 83: Hoare triple {66936#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {66932#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 00:54:53,549 INFO L290 TraceCheckUtils]: 82: Hoare triple {66936#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {66936#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 00:54:53,549 INFO L290 TraceCheckUtils]: 81: Hoare triple {66936#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {66936#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 00:54:53,789 INFO L290 TraceCheckUtils]: 80: Hoare triple {66946#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {66936#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-08 00:54:53,789 INFO L290 TraceCheckUtils]: 79: Hoare triple {66950#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {66946#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,790 INFO L290 TraceCheckUtils]: 78: Hoare triple {66950#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {66950#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,790 INFO L290 TraceCheckUtils]: 77: Hoare triple {66950#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {66950#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,949 INFO L290 TraceCheckUtils]: 76: Hoare triple {66960#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {66950#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,950 INFO L290 TraceCheckUtils]: 75: Hoare triple {66960#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {66960#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,951 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} {66967#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {66960#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,952 INFO L290 TraceCheckUtils]: 73: Hoare triple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:54:53,952 INFO L290 TraceCheckUtils]: 72: Hoare triple {66977#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:54:53,952 INFO L290 TraceCheckUtils]: 71: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66977#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:54:53,952 INFO L272 TraceCheckUtils]: 70: Hoare triple {66967#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {66640#true} is VALID [2022-04-08 00:54:53,953 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {66640#true} {66967#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {66967#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,953 INFO L290 TraceCheckUtils]: 68: Hoare triple {66640#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,953 INFO L290 TraceCheckUtils]: 67: Hoare triple {66640#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,953 INFO L290 TraceCheckUtils]: 66: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66640#true} is VALID [2022-04-08 00:54:53,954 INFO L272 TraceCheckUtils]: 65: Hoare triple {66967#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:54:53,955 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} {66999#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {66967#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,955 INFO L290 TraceCheckUtils]: 63: Hoare triple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:54:53,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {66977#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:54:53,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66977#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:54:53,956 INFO L272 TraceCheckUtils]: 60: Hoare triple {66999#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {66640#true} is VALID [2022-04-08 00:54:53,957 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} {67015#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {66999#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,957 INFO L290 TraceCheckUtils]: 58: Hoare triple {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:54:53,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {66977#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 00:54:53,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66977#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 00:54:53,958 INFO L272 TraceCheckUtils]: 55: Hoare triple {67015#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:54:53,959 INFO L290 TraceCheckUtils]: 54: Hoare triple {67015#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {67015#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {67015#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {67015#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,980 INFO L290 TraceCheckUtils]: 52: Hoare triple {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [150] L52-->L48-3: Formula: (let ((.cse0 (* v_main_~v~0_7 2))) (and (<= .cse0 v_main_~c~0_10) (= v_main_~v~0_6 .cse0) (= v_main_~d~0_5 (* v_main_~d~0_6 2)))) InVars {main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_7, main_~d~0=v_main_~d~0_6} OutVars{main_~c~0=v_main_~c~0_10, main_~v~0=v_main_~v~0_6, main_~d~0=v_main_~d~0_5} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {67015#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 00:54:53,982 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {66640#true} {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-08 00:54:53,982 INFO L290 TraceCheckUtils]: 50: Hoare triple {66640#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,982 INFO L290 TraceCheckUtils]: 49: Hoare triple {66640#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66640#true} is VALID [2022-04-08 00:54:53,982 INFO L272 TraceCheckUtils]: 47: Hoare triple {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {66640#true} is VALID [2022-04-08 00:54:53,983 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {66640#true} {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-08 00:54:53,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {66640#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {66640#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66640#true} is VALID [2022-04-08 00:54:53,983 INFO L272 TraceCheckUtils]: 42: Hoare triple {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:54:53,984 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {66640#true} {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-08 00:54:53,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {66640#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {66640#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66640#true} is VALID [2022-04-08 00:54:53,984 INFO L272 TraceCheckUtils]: 37: Hoare triple {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {66640#true} is VALID [2022-04-08 00:54:53,985 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {66640#true} {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-08 00:54:53,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {66640#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {66640#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {66640#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {66640#true} is VALID [2022-04-08 00:54:53,985 INFO L272 TraceCheckUtils]: 32: Hoare triple {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:54:53,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-08 00:54:53,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-08 00:54:53,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {67107#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {67037#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-08 00:54:53,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {67107#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {67107#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-08 00:54:53,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {67107#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {67107#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-08 00:54:53,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {66640#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {67107#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-08 00:54:53,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {66640#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {66640#true} is VALID [2022-04-08 00:54:53,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {66640#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {66640#true} is VALID [2022-04-08 00:54:53,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {66640#true} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:54:53,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {66640#true} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {66640#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {66640#true} is VALID [2022-04-08 00:54:53,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {66640#true} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {66640#true} is VALID [2022-04-08 00:54:53,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {66640#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {66640#true} is VALID [2022-04-08 00:54:53,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {66640#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {66640#true} is VALID [2022-04-08 00:54:53,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {66640#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {66640#true} is VALID [2022-04-08 00:54:53,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {66640#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:54:53,992 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66640#true} {66640#true} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {66640#true} is VALID [2022-04-08 00:54:53,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {66640#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {66640#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {66640#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {66640#true} is VALID [2022-04-08 00:54:53,992 INFO L272 TraceCheckUtils]: 11: Hoare triple {66640#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {66640#true} is VALID [2022-04-08 00:54:53,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66640#true} {66640#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {66640#true} is VALID [2022-04-08 00:54:53,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {66640#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {66640#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {66640#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {66640#true} is VALID [2022-04-08 00:54:53,993 INFO L272 TraceCheckUtils]: 6: Hoare triple {66640#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {66640#true} is VALID [2022-04-08 00:54:53,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {66640#true} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {66640#true} is VALID [2022-04-08 00:54:53,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {66640#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66640#true} {66640#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {66640#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {66640#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {66640#true} is VALID [2022-04-08 00:54:53,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {66640#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66640#true} is VALID [2022-04-08 00:54:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-08 00:54:53,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:54:53,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576565913] [2022-04-08 00:54:53,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:54:53,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782547878] [2022-04-08 00:54:53,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782547878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:54:53,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:54:53,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-04-08 00:54:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860646847] [2022-04-08 00:54:53,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:54:53,996 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 88 [2022-04-08 00:54:53,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:54:53,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-08 00:54:54,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:54:54,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 00:54:54,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:54:54,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 00:54:54,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-04-08 00:54:54,567 INFO L87 Difference]: Start difference. First operand 1416 states and 1904 transitions. Second operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-08 00:55:24,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 00:55:40,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 00:55:56,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 00:56:18,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 00:56:20,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 00:56:34,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 00:56:37,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 00:56:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:56:47,171 INFO L93 Difference]: Finished difference Result 1752 states and 2368 transitions. [2022-04-08 00:56:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-04-08 00:56:47,171 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 88 [2022-04-08 00:56:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:56:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-08 00:56:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 434 transitions. [2022-04-08 00:56:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-08 00:56:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 434 transitions. [2022-04-08 00:56:47,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 434 transitions. [2022-04-08 00:57:03,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 430 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-08 00:57:04,012 INFO L225 Difference]: With dead ends: 1752 [2022-04-08 00:57:04,012 INFO L226 Difference]: Without dead ends: 1741 [2022-04-08 00:57:04,015 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3879 ImplicationChecksByTransitivity, 46.8s TimeCoverageRelationStatistics Valid=1969, Invalid=9587, Unknown=0, NotChecked=0, Total=11556 [2022-04-08 00:57:04,015 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 388 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 491 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2022-04-08 00:57:04,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 978 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 1971 Invalid, 5 Unknown, 0 Unchecked, 30.3s Time] [2022-04-08 00:57:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2022-04-08 00:57:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1608. [2022-04-08 00:57:07,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:57:07,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1741 states. Second operand has 1608 states, 1156 states have (on average 1.2906574394463668) internal successors, (1492), 1165 states have internal predecessors, (1492), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) [2022-04-08 00:57:07,321 INFO L74 IsIncluded]: Start isIncluded. First operand 1741 states. Second operand has 1608 states, 1156 states have (on average 1.2906574394463668) internal successors, (1492), 1165 states have internal predecessors, (1492), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) [2022-04-08 00:57:07,324 INFO L87 Difference]: Start difference. First operand 1741 states. Second operand has 1608 states, 1156 states have (on average 1.2906574394463668) internal successors, (1492), 1165 states have internal predecessors, (1492), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) [2022-04-08 00:57:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:57:07,481 INFO L93 Difference]: Finished difference Result 1741 states and 2348 transitions. [2022-04-08 00:57:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2348 transitions. [2022-04-08 00:57:07,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:57:07,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:57:07,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 1608 states, 1156 states have (on average 1.2906574394463668) internal successors, (1492), 1165 states have internal predecessors, (1492), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) Second operand 1741 states. [2022-04-08 00:57:07,490 INFO L87 Difference]: Start difference. First operand has 1608 states, 1156 states have (on average 1.2906574394463668) internal successors, (1492), 1165 states have internal predecessors, (1492), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) Second operand 1741 states. [2022-04-08 00:57:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:57:07,640 INFO L93 Difference]: Finished difference Result 1741 states and 2348 transitions. [2022-04-08 00:57:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2348 transitions. [2022-04-08 00:57:07,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:57:07,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:57:07,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:57:07,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:57:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1156 states have (on average 1.2906574394463668) internal successors, (1492), 1165 states have internal predecessors, (1492), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) [2022-04-08 00:57:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2197 transitions. [2022-04-08 00:57:07,836 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2197 transitions. Word has length 88 [2022-04-08 00:57:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:57:07,836 INFO L478 AbstractCegarLoop]: Abstraction has 1608 states and 2197 transitions. [2022-04-08 00:57:07,837 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-08 00:57:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2197 transitions. [2022-04-08 00:57:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-08 00:57:07,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:57:07,838 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:57:07,870 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 00:57:08,047 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 00:57:08,047 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:57:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:57:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2096647522, now seen corresponding path program 1 times [2022-04-08 00:57:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:57:08,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403215013] [2022-04-08 00:57:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:57:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:57:08,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:57:08,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092061176] [2022-04-08 00:57:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:57:08,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:57:08,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:57:08,067 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 00:57:08,069 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 00:57:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:57:08,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 00:57:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:57:08,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:57:08,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {75664#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:08,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {75664#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {75672#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75672#(<= ~counter~0 0)} {75664#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {75672#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {75672#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {75672#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {75672#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {75672#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {75672#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75672#(<= ~counter~0 0)} {75672#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,637 INFO L272 TraceCheckUtils]: 11: Hoare triple {75672#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {75672#(<= ~counter~0 0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {75672#(<= ~counter~0 0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {75672#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,638 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75672#(<= ~counter~0 0)} {75672#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {75672#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:08,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {75672#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {75721#(<= ~counter~0 1)} is VALID [2022-04-08 00:57:08,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {75721#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {75721#(<= ~counter~0 1)} is VALID [2022-04-08 00:57:08,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {75721#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {75721#(<= ~counter~0 1)} is VALID [2022-04-08 00:57:08,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {75721#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {75731#(<= ~counter~0 2)} is VALID [2022-04-08 00:57:08,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {75731#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {75731#(<= ~counter~0 2)} is VALID [2022-04-08 00:57:08,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {75731#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {75731#(<= ~counter~0 2)} is VALID [2022-04-08 00:57:08,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {75731#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75731#(<= ~counter~0 2)} is VALID [2022-04-08 00:57:08,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {75731#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {75744#(<= ~counter~0 3)} is VALID [2022-04-08 00:57:08,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {75744#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {75744#(<= ~counter~0 3)} is VALID [2022-04-08 00:57:08,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {75744#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {75744#(<= ~counter~0 3)} is VALID [2022-04-08 00:57:08,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {75744#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {75754#(<= ~counter~0 4)} is VALID [2022-04-08 00:57:08,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {75754#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {75754#(<= ~counter~0 4)} is VALID [2022-04-08 00:57:08,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {75754#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {75754#(<= ~counter~0 4)} is VALID [2022-04-08 00:57:08,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {75754#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {75764#(<= ~counter~0 5)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,646 INFO L272 TraceCheckUtils]: 32: Hoare triple {75764#(<= ~counter~0 5)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {75764#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {75764#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {75764#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,648 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75764#(<= ~counter~0 5)} {75764#(<= ~counter~0 5)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,648 INFO L272 TraceCheckUtils]: 37: Hoare triple {75764#(<= ~counter~0 5)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {75764#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {75764#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {75764#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,650 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {75764#(<= ~counter~0 5)} {75764#(<= ~counter~0 5)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,650 INFO L272 TraceCheckUtils]: 42: Hoare triple {75764#(<= ~counter~0 5)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,651 INFO L290 TraceCheckUtils]: 43: Hoare triple {75764#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,651 INFO L290 TraceCheckUtils]: 44: Hoare triple {75764#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {75764#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,652 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {75764#(<= ~counter~0 5)} {75764#(<= ~counter~0 5)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,652 INFO L272 TraceCheckUtils]: 47: Hoare triple {75764#(<= ~counter~0 5)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {75764#(<= ~counter~0 5)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {75764#(<= ~counter~0 5)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {75764#(<= ~counter~0 5)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,654 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {75764#(<= ~counter~0 5)} {75764#(<= ~counter~0 5)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,654 INFO L290 TraceCheckUtils]: 52: Hoare triple {75764#(<= ~counter~0 5)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {75764#(<= ~counter~0 5)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:08,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {75764#(<= ~counter~0 5)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {75837#(<= ~counter~0 6)} is VALID [2022-04-08 00:57:08,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {75837#(<= ~counter~0 6)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {75837#(<= ~counter~0 6)} is VALID [2022-04-08 00:57:08,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {75837#(<= ~counter~0 6)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {75837#(<= ~counter~0 6)} is VALID [2022-04-08 00:57:08,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {75837#(<= ~counter~0 6)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75837#(<= ~counter~0 6)} is VALID [2022-04-08 00:57:08,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {75837#(<= ~counter~0 6)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {75850#(<= ~counter~0 7)} is VALID [2022-04-08 00:57:08,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {75850#(<= ~counter~0 7)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {75850#(<= ~counter~0 7)} is VALID [2022-04-08 00:57:08,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {75850#(<= ~counter~0 7)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {75850#(<= ~counter~0 7)} is VALID [2022-04-08 00:57:08,658 INFO L290 TraceCheckUtils]: 61: Hoare triple {75850#(<= ~counter~0 7)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {75860#(<= ~counter~0 8)} is VALID [2022-04-08 00:57:08,658 INFO L290 TraceCheckUtils]: 62: Hoare triple {75860#(<= ~counter~0 8)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {75860#(<= ~counter~0 8)} is VALID [2022-04-08 00:57:08,659 INFO L290 TraceCheckUtils]: 63: Hoare triple {75860#(<= ~counter~0 8)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {75860#(<= ~counter~0 8)} is VALID [2022-04-08 00:57:08,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {75860#(<= ~counter~0 8)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,660 INFO L290 TraceCheckUtils]: 65: Hoare triple {75870#(<= ~counter~0 9)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,660 INFO L272 TraceCheckUtils]: 66: Hoare triple {75870#(<= ~counter~0 9)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,660 INFO L290 TraceCheckUtils]: 67: Hoare triple {75870#(<= ~counter~0 9)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {75870#(<= ~counter~0 9)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {75870#(<= ~counter~0 9)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,662 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {75870#(<= ~counter~0 9)} {75870#(<= ~counter~0 9)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,662 INFO L272 TraceCheckUtils]: 71: Hoare triple {75870#(<= ~counter~0 9)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,662 INFO L290 TraceCheckUtils]: 72: Hoare triple {75870#(<= ~counter~0 9)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,663 INFO L290 TraceCheckUtils]: 73: Hoare triple {75870#(<= ~counter~0 9)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,663 INFO L290 TraceCheckUtils]: 74: Hoare triple {75870#(<= ~counter~0 9)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,664 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {75870#(<= ~counter~0 9)} {75870#(<= ~counter~0 9)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,664 INFO L272 TraceCheckUtils]: 76: Hoare triple {75870#(<= ~counter~0 9)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,664 INFO L290 TraceCheckUtils]: 77: Hoare triple {75870#(<= ~counter~0 9)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,665 INFO L290 TraceCheckUtils]: 78: Hoare triple {75870#(<= ~counter~0 9)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,665 INFO L290 TraceCheckUtils]: 79: Hoare triple {75870#(<= ~counter~0 9)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,666 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {75870#(<= ~counter~0 9)} {75870#(<= ~counter~0 9)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,666 INFO L272 TraceCheckUtils]: 81: Hoare triple {75870#(<= ~counter~0 9)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,666 INFO L290 TraceCheckUtils]: 82: Hoare triple {75870#(<= ~counter~0 9)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,667 INFO L290 TraceCheckUtils]: 83: Hoare triple {75870#(<= ~counter~0 9)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,667 INFO L290 TraceCheckUtils]: 84: Hoare triple {75870#(<= ~counter~0 9)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,667 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {75870#(<= ~counter~0 9)} {75870#(<= ~counter~0 9)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,668 INFO L290 TraceCheckUtils]: 86: Hoare triple {75870#(<= ~counter~0 9)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,668 INFO L290 TraceCheckUtils]: 87: Hoare triple {75870#(<= ~counter~0 9)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:08,668 INFO L290 TraceCheckUtils]: 88: Hoare triple {75870#(<= ~counter~0 9)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {75943#(<= |main_#t~post7| 9)} is VALID [2022-04-08 00:57:08,669 INFO L290 TraceCheckUtils]: 89: Hoare triple {75943#(<= |main_#t~post7| 9)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {75665#false} is VALID [2022-04-08 00:57:08,669 INFO L290 TraceCheckUtils]: 90: Hoare triple {75665#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75665#false} is VALID [2022-04-08 00:57:08,669 INFO L290 TraceCheckUtils]: 91: Hoare triple {75665#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {75665#false} is VALID [2022-04-08 00:57:08,669 INFO L290 TraceCheckUtils]: 92: Hoare triple {75665#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {75665#false} is VALID [2022-04-08 00:57:08,669 INFO L272 TraceCheckUtils]: 93: Hoare triple {75665#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75665#false} is VALID [2022-04-08 00:57:08,669 INFO L290 TraceCheckUtils]: 94: Hoare triple {75665#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75665#false} is VALID [2022-04-08 00:57:08,669 INFO L290 TraceCheckUtils]: 95: Hoare triple {75665#false} [134] L11-->L12: 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[] {75665#false} is VALID [2022-04-08 00:57:08,670 INFO L290 TraceCheckUtils]: 96: Hoare triple {75665#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75665#false} is VALID [2022-04-08 00:57:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 24 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-08 00:57:08,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:57:09,121 INFO L290 TraceCheckUtils]: 96: Hoare triple {75665#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75665#false} is VALID [2022-04-08 00:57:09,121 INFO L290 TraceCheckUtils]: 95: Hoare triple {75665#false} [134] L11-->L12: 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[] {75665#false} is VALID [2022-04-08 00:57:09,121 INFO L290 TraceCheckUtils]: 94: Hoare triple {75665#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75665#false} is VALID [2022-04-08 00:57:09,121 INFO L272 TraceCheckUtils]: 93: Hoare triple {75665#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75665#false} is VALID [2022-04-08 00:57:09,121 INFO L290 TraceCheckUtils]: 92: Hoare triple {75665#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {75665#false} is VALID [2022-04-08 00:57:09,121 INFO L290 TraceCheckUtils]: 91: Hoare triple {75665#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {75665#false} is VALID [2022-04-08 00:57:09,121 INFO L290 TraceCheckUtils]: 90: Hoare triple {75665#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75665#false} is VALID [2022-04-08 00:57:09,122 INFO L290 TraceCheckUtils]: 89: Hoare triple {75943#(<= |main_#t~post7| 9)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 10)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {75665#false} is VALID [2022-04-08 00:57:09,122 INFO L290 TraceCheckUtils]: 88: Hoare triple {75870#(<= ~counter~0 9)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {75943#(<= |main_#t~post7| 9)} is VALID [2022-04-08 00:57:09,122 INFO L290 TraceCheckUtils]: 87: Hoare triple {75870#(<= ~counter~0 9)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:09,123 INFO L290 TraceCheckUtils]: 86: Hoare triple {75870#(<= ~counter~0 9)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:09,123 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {75664#true} {75870#(<= ~counter~0 9)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:09,123 INFO L290 TraceCheckUtils]: 84: Hoare triple {75664#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,123 INFO L290 TraceCheckUtils]: 83: Hoare triple {75664#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,124 INFO L290 TraceCheckUtils]: 82: Hoare triple {75664#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75664#true} is VALID [2022-04-08 00:57:09,124 INFO L272 TraceCheckUtils]: 81: Hoare triple {75870#(<= ~counter~0 9)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {75664#true} is VALID [2022-04-08 00:57:09,124 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {75664#true} {75870#(<= ~counter~0 9)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:09,124 INFO L290 TraceCheckUtils]: 79: Hoare triple {75664#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,124 INFO L290 TraceCheckUtils]: 78: Hoare triple {75664#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,124 INFO L290 TraceCheckUtils]: 77: Hoare triple {75664#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75664#true} is VALID [2022-04-08 00:57:09,124 INFO L272 TraceCheckUtils]: 76: Hoare triple {75870#(<= ~counter~0 9)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {75664#true} is VALID [2022-04-08 00:57:09,125 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {75664#true} {75870#(<= ~counter~0 9)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:09,125 INFO L290 TraceCheckUtils]: 74: Hoare triple {75664#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,125 INFO L290 TraceCheckUtils]: 73: Hoare triple {75664#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,125 INFO L290 TraceCheckUtils]: 72: Hoare triple {75664#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75664#true} is VALID [2022-04-08 00:57:09,125 INFO L272 TraceCheckUtils]: 71: Hoare triple {75870#(<= ~counter~0 9)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {75664#true} is VALID [2022-04-08 00:57:09,126 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {75664#true} {75870#(<= ~counter~0 9)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:09,126 INFO L290 TraceCheckUtils]: 69: Hoare triple {75664#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,126 INFO L290 TraceCheckUtils]: 68: Hoare triple {75664#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,126 INFO L290 TraceCheckUtils]: 67: Hoare triple {75664#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75664#true} is VALID [2022-04-08 00:57:09,126 INFO L272 TraceCheckUtils]: 66: Hoare triple {75870#(<= ~counter~0 9)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {75664#true} is VALID [2022-04-08 00:57:09,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {75870#(<= ~counter~0 9)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:09,128 INFO L290 TraceCheckUtils]: 64: Hoare triple {75860#(<= ~counter~0 8)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {75870#(<= ~counter~0 9)} is VALID [2022-04-08 00:57:09,128 INFO L290 TraceCheckUtils]: 63: Hoare triple {75860#(<= ~counter~0 8)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {75860#(<= ~counter~0 8)} is VALID [2022-04-08 00:57:09,129 INFO L290 TraceCheckUtils]: 62: Hoare triple {75860#(<= ~counter~0 8)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {75860#(<= ~counter~0 8)} is VALID [2022-04-08 00:57:09,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {75850#(<= ~counter~0 7)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {75860#(<= ~counter~0 8)} is VALID [2022-04-08 00:57:09,130 INFO L290 TraceCheckUtils]: 60: Hoare triple {75850#(<= ~counter~0 7)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {75850#(<= ~counter~0 7)} is VALID [2022-04-08 00:57:09,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {75850#(<= ~counter~0 7)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {75850#(<= ~counter~0 7)} is VALID [2022-04-08 00:57:09,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {75837#(<= ~counter~0 6)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {75850#(<= ~counter~0 7)} is VALID [2022-04-08 00:57:09,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {75837#(<= ~counter~0 6)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75837#(<= ~counter~0 6)} is VALID [2022-04-08 00:57:09,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {75837#(<= ~counter~0 6)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {75837#(<= ~counter~0 6)} is VALID [2022-04-08 00:57:09,132 INFO L290 TraceCheckUtils]: 55: Hoare triple {75837#(<= ~counter~0 6)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {75837#(<= ~counter~0 6)} is VALID [2022-04-08 00:57:09,133 INFO L290 TraceCheckUtils]: 54: Hoare triple {75764#(<= ~counter~0 5)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {75837#(<= ~counter~0 6)} is VALID [2022-04-08 00:57:09,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {75764#(<= ~counter~0 5)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:09,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {75764#(<= ~counter~0 5)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:09,134 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {75664#true} {75764#(<= ~counter~0 5)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:09,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {75664#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {75664#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {75664#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75664#true} is VALID [2022-04-08 00:57:09,134 INFO L272 TraceCheckUtils]: 47: Hoare triple {75764#(<= ~counter~0 5)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {75664#true} is VALID [2022-04-08 00:57:09,135 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {75664#true} {75764#(<= ~counter~0 5)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:09,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {75664#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {75664#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {75664#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75664#true} is VALID [2022-04-08 00:57:09,135 INFO L272 TraceCheckUtils]: 42: Hoare triple {75764#(<= ~counter~0 5)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {75664#true} is VALID [2022-04-08 00:57:09,136 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {75664#true} {75764#(<= ~counter~0 5)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:09,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {75664#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {75664#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {75664#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75664#true} is VALID [2022-04-08 00:57:09,136 INFO L272 TraceCheckUtils]: 37: Hoare triple {75764#(<= ~counter~0 5)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {75664#true} is VALID [2022-04-08 00:57:09,137 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75664#true} {75764#(<= ~counter~0 5)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:09,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {75664#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {75664#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {75664#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {75664#true} is VALID [2022-04-08 00:57:09,137 INFO L272 TraceCheckUtils]: 32: Hoare triple {75764#(<= ~counter~0 5)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {75664#true} is VALID [2022-04-08 00:57:09,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {75764#(<= ~counter~0 5)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:09,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {75754#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {75764#(<= ~counter~0 5)} is VALID [2022-04-08 00:57:09,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {75754#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {75754#(<= ~counter~0 4)} is VALID [2022-04-08 00:57:09,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {75754#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {75754#(<= ~counter~0 4)} is VALID [2022-04-08 00:57:09,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {75744#(<= ~counter~0 3)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {75754#(<= ~counter~0 4)} is VALID [2022-04-08 00:57:09,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {75744#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {75744#(<= ~counter~0 3)} is VALID [2022-04-08 00:57:09,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {75744#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {75744#(<= ~counter~0 3)} is VALID [2022-04-08 00:57:09,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {75731#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {75744#(<= ~counter~0 3)} is VALID [2022-04-08 00:57:09,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {75731#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75731#(<= ~counter~0 2)} is VALID [2022-04-08 00:57:09,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {75731#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {75731#(<= ~counter~0 2)} is VALID [2022-04-08 00:57:09,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {75731#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {75731#(<= ~counter~0 2)} is VALID [2022-04-08 00:57:09,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {75721#(<= ~counter~0 1)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {75731#(<= ~counter~0 2)} is VALID [2022-04-08 00:57:09,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {75721#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {75721#(<= ~counter~0 1)} is VALID [2022-04-08 00:57:09,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {75721#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {75721#(<= ~counter~0 1)} is VALID [2022-04-08 00:57:09,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {75672#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {75721#(<= ~counter~0 1)} is VALID [2022-04-08 00:57:09,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {75672#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:09,145 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75664#true} {75672#(<= ~counter~0 0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:09,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {75664#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {75664#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {75664#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {75664#true} is VALID [2022-04-08 00:57:09,146 INFO L272 TraceCheckUtils]: 11: Hoare triple {75672#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {75664#true} is VALID [2022-04-08 00:57:09,146 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75664#true} {75672#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:09,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {75664#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {75664#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {75664#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {75664#true} is VALID [2022-04-08 00:57:09,146 INFO L272 TraceCheckUtils]: 6: Hoare triple {75672#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {75664#true} is VALID [2022-04-08 00:57:09,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {75672#(<= ~counter~0 0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:09,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {75672#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:09,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75672#(<= ~counter~0 0)} {75664#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:09,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {75672#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:09,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {75664#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {75672#(<= ~counter~0 0)} is VALID [2022-04-08 00:57:09,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {75664#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75664#true} is VALID [2022-04-08 00:57:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 00:57:09,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:57:09,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403215013] [2022-04-08 00:57:09,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:57:09,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092061176] [2022-04-08 00:57:09,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092061176] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:57:09,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:57:09,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-08 00:57:09,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975931990] [2022-04-08 00:57:09,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:57:09,151 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 97 [2022-04-08 00:57:09,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:57:09,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-08 00:57:09,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:57:09,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 00:57:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:57:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 00:57:09,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 00:57:09,266 INFO L87 Difference]: Start difference. First operand 1608 states and 2197 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-08 00:57:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:57:13,969 INFO L93 Difference]: Finished difference Result 2291 states and 3250 transitions. [2022-04-08 00:57:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 00:57:13,969 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 97 [2022-04-08 00:57:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:57:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-08 00:57:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 258 transitions. [2022-04-08 00:57:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-08 00:57:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 258 transitions. [2022-04-08 00:57:13,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 258 transitions. [2022-04-08 00:57:14,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:57:14,404 INFO L225 Difference]: With dead ends: 2291 [2022-04-08 00:57:14,404 INFO L226 Difference]: Without dead ends: 1637 [2022-04-08 00:57:14,406 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2022-04-08 00:57:14,406 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 231 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 00:57:14,407 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 291 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 00:57:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2022-04-08 00:57:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1624. [2022-04-08 00:57:17,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:57:17,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1637 states. Second operand has 1624 states, 1172 states have (on average 1.27901023890785) internal successors, (1499), 1181 states have internal predecessors, (1499), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) [2022-04-08 00:57:17,770 INFO L74 IsIncluded]: Start isIncluded. First operand 1637 states. Second operand has 1624 states, 1172 states have (on average 1.27901023890785) internal successors, (1499), 1181 states have internal predecessors, (1499), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) [2022-04-08 00:57:17,772 INFO L87 Difference]: Start difference. First operand 1637 states. Second operand has 1624 states, 1172 states have (on average 1.27901023890785) internal successors, (1499), 1181 states have internal predecessors, (1499), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) [2022-04-08 00:57:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:57:17,852 INFO L93 Difference]: Finished difference Result 1637 states and 2215 transitions. [2022-04-08 00:57:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2215 transitions. [2022-04-08 00:57:17,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:57:17,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:57:17,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 1624 states, 1172 states have (on average 1.27901023890785) internal successors, (1499), 1181 states have internal predecessors, (1499), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) Second operand 1637 states. [2022-04-08 00:57:17,858 INFO L87 Difference]: Start difference. First operand has 1624 states, 1172 states have (on average 1.27901023890785) internal successors, (1499), 1181 states have internal predecessors, (1499), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) Second operand 1637 states. [2022-04-08 00:57:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:57:17,944 INFO L93 Difference]: Finished difference Result 1637 states and 2215 transitions. [2022-04-08 00:57:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2215 transitions. [2022-04-08 00:57:17,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:57:17,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:57:17,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:57:17,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:57:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1172 states have (on average 1.27901023890785) internal successors, (1499), 1181 states have internal predecessors, (1499), 354 states have call successors, (354), 99 states have call predecessors, (354), 97 states have return successors, (351), 343 states have call predecessors, (351), 351 states have call successors, (351) [2022-04-08 00:57:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2204 transitions. [2022-04-08 00:57:18,065 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2204 transitions. Word has length 97 [2022-04-08 00:57:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:57:18,065 INFO L478 AbstractCegarLoop]: Abstraction has 1624 states and 2204 transitions. [2022-04-08 00:57:18,065 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-08 00:57:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2204 transitions. [2022-04-08 00:57:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-08 00:57:18,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:57:18,066 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:57:18,082 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 00:57:18,268 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 00:57:18,268 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:57:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:57:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1189405093, now seen corresponding path program 3 times [2022-04-08 00:57:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:57:18,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628130801] [2022-04-08 00:57:18,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:57:18,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:57:18,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:57:18,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175720560] [2022-04-08 00:57:18,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-08 00:57:18,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:57:18,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:57:18,284 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 00:57:18,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 00:57:18,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-08 00:57:18,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 00:57:18,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 00:57:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 00:57:18,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 00:57:18,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {85204#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:18,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {85204#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {85212#(<= 0 ~counter~0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85212#(<= 0 ~counter~0)} {85204#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {85212#(<= 0 ~counter~0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {85212#(<= 0 ~counter~0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {85212#(<= 0 ~counter~0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {85212#(<= 0 ~counter~0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {85212#(<= 0 ~counter~0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {85212#(<= 0 ~counter~0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {85212#(<= 0 ~counter~0)} {85212#(<= 0 ~counter~0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,898 INFO L272 TraceCheckUtils]: 11: Hoare triple {85212#(<= 0 ~counter~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {85212#(<= 0 ~counter~0)} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {85212#(<= 0 ~counter~0)} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {85212#(<= 0 ~counter~0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,900 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {85212#(<= 0 ~counter~0)} {85212#(<= 0 ~counter~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {85212#(<= 0 ~counter~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:18,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {85212#(<= 0 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {85261#(<= 1 ~counter~0)} is VALID [2022-04-08 00:57:18,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {85261#(<= 1 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {85261#(<= 1 ~counter~0)} is VALID [2022-04-08 00:57:18,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {85261#(<= 1 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {85261#(<= 1 ~counter~0)} is VALID [2022-04-08 00:57:18,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {85261#(<= 1 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {85271#(<= 2 ~counter~0)} is VALID [2022-04-08 00:57:18,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {85271#(<= 2 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {85271#(<= 2 ~counter~0)} is VALID [2022-04-08 00:57:18,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {85271#(<= 2 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {85271#(<= 2 ~counter~0)} is VALID [2022-04-08 00:57:18,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {85271#(<= 2 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {85281#(<= 3 ~counter~0)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,906 INFO L272 TraceCheckUtils]: 25: Hoare triple {85281#(<= 3 ~counter~0)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {85281#(<= 3 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {85281#(<= 3 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {85281#(<= 3 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,908 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {85281#(<= 3 ~counter~0)} {85281#(<= 3 ~counter~0)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,909 INFO L272 TraceCheckUtils]: 30: Hoare triple {85281#(<= 3 ~counter~0)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {85281#(<= 3 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {85281#(<= 3 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {85281#(<= 3 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,910 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {85281#(<= 3 ~counter~0)} {85281#(<= 3 ~counter~0)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,911 INFO L272 TraceCheckUtils]: 35: Hoare triple {85281#(<= 3 ~counter~0)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {85281#(<= 3 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {85281#(<= 3 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {85281#(<= 3 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,922 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {85281#(<= 3 ~counter~0)} {85281#(<= 3 ~counter~0)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,923 INFO L272 TraceCheckUtils]: 40: Hoare triple {85281#(<= 3 ~counter~0)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,923 INFO L290 TraceCheckUtils]: 41: Hoare triple {85281#(<= 3 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {85281#(<= 3 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {85281#(<= 3 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,924 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {85281#(<= 3 ~counter~0)} {85281#(<= 3 ~counter~0)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {85281#(<= 3 ~counter~0)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {85281#(<= 3 ~counter~0)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:18,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {85281#(<= 3 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {85354#(<= 4 ~counter~0)} is VALID [2022-04-08 00:57:18,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {85354#(<= 4 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {85354#(<= 4 ~counter~0)} is VALID [2022-04-08 00:57:18,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {85354#(<= 4 ~counter~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {85354#(<= 4 ~counter~0)} is VALID [2022-04-08 00:57:18,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {85354#(<= 4 ~counter~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {85354#(<= 4 ~counter~0)} is VALID [2022-04-08 00:57:18,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {85354#(<= 4 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {85367#(<= 5 ~counter~0)} is VALID [2022-04-08 00:57:18,929 INFO L290 TraceCheckUtils]: 52: Hoare triple {85367#(<= 5 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {85367#(<= 5 ~counter~0)} is VALID [2022-04-08 00:57:18,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {85367#(<= 5 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {85367#(<= 5 ~counter~0)} is VALID [2022-04-08 00:57:18,931 INFO L290 TraceCheckUtils]: 54: Hoare triple {85367#(<= 5 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {85377#(<= 6 ~counter~0)} is VALID [2022-04-08 00:57:18,931 INFO L290 TraceCheckUtils]: 55: Hoare triple {85377#(<= 6 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {85377#(<= 6 ~counter~0)} is VALID [2022-04-08 00:57:18,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {85377#(<= 6 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {85377#(<= 6 ~counter~0)} is VALID [2022-04-08 00:57:18,932 INFO L290 TraceCheckUtils]: 57: Hoare triple {85377#(<= 6 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,933 INFO L290 TraceCheckUtils]: 58: Hoare triple {85387#(<= 7 ~counter~0)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,933 INFO L272 TraceCheckUtils]: 59: Hoare triple {85387#(<= 7 ~counter~0)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {85387#(<= 7 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,934 INFO L290 TraceCheckUtils]: 61: Hoare triple {85387#(<= 7 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {85387#(<= 7 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,935 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {85387#(<= 7 ~counter~0)} {85387#(<= 7 ~counter~0)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,936 INFO L272 TraceCheckUtils]: 64: Hoare triple {85387#(<= 7 ~counter~0)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,936 INFO L290 TraceCheckUtils]: 65: Hoare triple {85387#(<= 7 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,937 INFO L290 TraceCheckUtils]: 66: Hoare triple {85387#(<= 7 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,937 INFO L290 TraceCheckUtils]: 67: Hoare triple {85387#(<= 7 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,938 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {85387#(<= 7 ~counter~0)} {85387#(<= 7 ~counter~0)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,938 INFO L272 TraceCheckUtils]: 69: Hoare triple {85387#(<= 7 ~counter~0)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,939 INFO L290 TraceCheckUtils]: 70: Hoare triple {85387#(<= 7 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,939 INFO L290 TraceCheckUtils]: 71: Hoare triple {85387#(<= 7 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,939 INFO L290 TraceCheckUtils]: 72: Hoare triple {85387#(<= 7 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,940 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {85387#(<= 7 ~counter~0)} {85387#(<= 7 ~counter~0)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,941 INFO L272 TraceCheckUtils]: 74: Hoare triple {85387#(<= 7 ~counter~0)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,941 INFO L290 TraceCheckUtils]: 75: Hoare triple {85387#(<= 7 ~counter~0)} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,942 INFO L290 TraceCheckUtils]: 76: Hoare triple {85387#(<= 7 ~counter~0)} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,942 INFO L290 TraceCheckUtils]: 77: Hoare triple {85387#(<= 7 ~counter~0)} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,943 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {85387#(<= 7 ~counter~0)} {85387#(<= 7 ~counter~0)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,943 INFO L290 TraceCheckUtils]: 79: Hoare triple {85387#(<= 7 ~counter~0)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,944 INFO L290 TraceCheckUtils]: 80: Hoare triple {85387#(<= 7 ~counter~0)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:18,945 INFO L290 TraceCheckUtils]: 81: Hoare triple {85387#(<= 7 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {85460#(<= 8 ~counter~0)} is VALID [2022-04-08 00:57:18,946 INFO L290 TraceCheckUtils]: 82: Hoare triple {85460#(<= 8 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {85460#(<= 8 ~counter~0)} is VALID [2022-04-08 00:57:18,946 INFO L290 TraceCheckUtils]: 83: Hoare triple {85460#(<= 8 ~counter~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {85460#(<= 8 ~counter~0)} is VALID [2022-04-08 00:57:18,946 INFO L290 TraceCheckUtils]: 84: Hoare triple {85460#(<= 8 ~counter~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {85460#(<= 8 ~counter~0)} is VALID [2022-04-08 00:57:18,947 INFO L290 TraceCheckUtils]: 85: Hoare triple {85460#(<= 8 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {85473#(<= 9 ~counter~0)} is VALID [2022-04-08 00:57:18,948 INFO L290 TraceCheckUtils]: 86: Hoare triple {85473#(<= 9 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {85473#(<= 9 ~counter~0)} is VALID [2022-04-08 00:57:18,948 INFO L290 TraceCheckUtils]: 87: Hoare triple {85473#(<= 9 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {85473#(<= 9 ~counter~0)} is VALID [2022-04-08 00:57:18,949 INFO L290 TraceCheckUtils]: 88: Hoare triple {85473#(<= 9 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {85483#(<= 10 ~counter~0)} is VALID [2022-04-08 00:57:18,949 INFO L290 TraceCheckUtils]: 89: Hoare triple {85483#(<= 10 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {85483#(<= 10 ~counter~0)} is VALID [2022-04-08 00:57:18,950 INFO L290 TraceCheckUtils]: 90: Hoare triple {85483#(<= 10 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {85483#(<= 10 ~counter~0)} is VALID [2022-04-08 00:57:18,950 INFO L290 TraceCheckUtils]: 91: Hoare triple {85483#(<= 10 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {85493#(<= 10 |main_#t~post8|)} is VALID [2022-04-08 00:57:18,951 INFO L290 TraceCheckUtils]: 92: Hoare triple {85493#(<= 10 |main_#t~post8|)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {85205#false} is VALID [2022-04-08 00:57:18,951 INFO L272 TraceCheckUtils]: 93: Hoare triple {85205#false} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {85205#false} is VALID [2022-04-08 00:57:18,951 INFO L290 TraceCheckUtils]: 94: Hoare triple {85205#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85205#false} is VALID [2022-04-08 00:57:18,951 INFO L290 TraceCheckUtils]: 95: Hoare triple {85205#false} [134] L11-->L12: 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[] {85205#false} is VALID [2022-04-08 00:57:18,951 INFO L290 TraceCheckUtils]: 96: Hoare triple {85205#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85205#false} is VALID [2022-04-08 00:57:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-08 00:57:18,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 00:57:19,379 INFO L290 TraceCheckUtils]: 96: Hoare triple {85205#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85205#false} is VALID [2022-04-08 00:57:19,380 INFO L290 TraceCheckUtils]: 95: Hoare triple {85205#false} [134] L11-->L12: 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[] {85205#false} is VALID [2022-04-08 00:57:19,380 INFO L290 TraceCheckUtils]: 94: Hoare triple {85205#false} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85205#false} is VALID [2022-04-08 00:57:19,380 INFO L272 TraceCheckUtils]: 93: Hoare triple {85205#false} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {85205#false} is VALID [2022-04-08 00:57:19,380 INFO L290 TraceCheckUtils]: 92: Hoare triple {85493#(<= 10 |main_#t~post8|)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {85205#false} is VALID [2022-04-08 00:57:19,380 INFO L290 TraceCheckUtils]: 91: Hoare triple {85483#(<= 10 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {85493#(<= 10 |main_#t~post8|)} is VALID [2022-04-08 00:57:19,381 INFO L290 TraceCheckUtils]: 90: Hoare triple {85483#(<= 10 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {85483#(<= 10 ~counter~0)} is VALID [2022-04-08 00:57:19,381 INFO L290 TraceCheckUtils]: 89: Hoare triple {85483#(<= 10 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {85483#(<= 10 ~counter~0)} is VALID [2022-04-08 00:57:19,382 INFO L290 TraceCheckUtils]: 88: Hoare triple {85473#(<= 9 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {85483#(<= 10 ~counter~0)} is VALID [2022-04-08 00:57:19,383 INFO L290 TraceCheckUtils]: 87: Hoare triple {85473#(<= 9 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {85473#(<= 9 ~counter~0)} is VALID [2022-04-08 00:57:19,383 INFO L290 TraceCheckUtils]: 86: Hoare triple {85473#(<= 9 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {85473#(<= 9 ~counter~0)} is VALID [2022-04-08 00:57:19,384 INFO L290 TraceCheckUtils]: 85: Hoare triple {85460#(<= 8 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {85473#(<= 9 ~counter~0)} is VALID [2022-04-08 00:57:19,384 INFO L290 TraceCheckUtils]: 84: Hoare triple {85460#(<= 8 ~counter~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {85460#(<= 8 ~counter~0)} is VALID [2022-04-08 00:57:19,384 INFO L290 TraceCheckUtils]: 83: Hoare triple {85460#(<= 8 ~counter~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {85460#(<= 8 ~counter~0)} is VALID [2022-04-08 00:57:19,385 INFO L290 TraceCheckUtils]: 82: Hoare triple {85460#(<= 8 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {85460#(<= 8 ~counter~0)} is VALID [2022-04-08 00:57:19,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {85387#(<= 7 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {85460#(<= 8 ~counter~0)} is VALID [2022-04-08 00:57:19,386 INFO L290 TraceCheckUtils]: 80: Hoare triple {85387#(<= 7 ~counter~0)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:19,386 INFO L290 TraceCheckUtils]: 79: Hoare triple {85387#(<= 7 ~counter~0)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:19,386 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {85204#true} {85387#(<= 7 ~counter~0)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:19,387 INFO L290 TraceCheckUtils]: 77: Hoare triple {85204#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,387 INFO L290 TraceCheckUtils]: 76: Hoare triple {85204#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,387 INFO L290 TraceCheckUtils]: 75: Hoare triple {85204#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85204#true} is VALID [2022-04-08 00:57:19,387 INFO L272 TraceCheckUtils]: 74: Hoare triple {85387#(<= 7 ~counter~0)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {85204#true} is VALID [2022-04-08 00:57:19,387 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {85204#true} {85387#(<= 7 ~counter~0)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:19,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {85204#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {85204#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,388 INFO L290 TraceCheckUtils]: 70: Hoare triple {85204#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85204#true} is VALID [2022-04-08 00:57:19,388 INFO L272 TraceCheckUtils]: 69: Hoare triple {85387#(<= 7 ~counter~0)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {85204#true} is VALID [2022-04-08 00:57:19,388 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {85204#true} {85387#(<= 7 ~counter~0)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:19,388 INFO L290 TraceCheckUtils]: 67: Hoare triple {85204#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,388 INFO L290 TraceCheckUtils]: 66: Hoare triple {85204#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,389 INFO L290 TraceCheckUtils]: 65: Hoare triple {85204#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85204#true} is VALID [2022-04-08 00:57:19,389 INFO L272 TraceCheckUtils]: 64: Hoare triple {85387#(<= 7 ~counter~0)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {85204#true} is VALID [2022-04-08 00:57:19,389 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {85204#true} {85387#(<= 7 ~counter~0)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:19,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {85204#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {85204#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {85204#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85204#true} is VALID [2022-04-08 00:57:19,390 INFO L272 TraceCheckUtils]: 59: Hoare triple {85387#(<= 7 ~counter~0)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {85204#true} is VALID [2022-04-08 00:57:19,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {85387#(<= 7 ~counter~0)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:19,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {85377#(<= 6 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {85387#(<= 7 ~counter~0)} is VALID [2022-04-08 00:57:19,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {85377#(<= 6 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {85377#(<= 6 ~counter~0)} is VALID [2022-04-08 00:57:19,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {85377#(<= 6 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {85377#(<= 6 ~counter~0)} is VALID [2022-04-08 00:57:19,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {85367#(<= 5 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {85377#(<= 6 ~counter~0)} is VALID [2022-04-08 00:57:19,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {85367#(<= 5 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {85367#(<= 5 ~counter~0)} is VALID [2022-04-08 00:57:19,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {85367#(<= 5 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {85367#(<= 5 ~counter~0)} is VALID [2022-04-08 00:57:19,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {85354#(<= 4 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {85367#(<= 5 ~counter~0)} is VALID [2022-04-08 00:57:19,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {85354#(<= 4 ~counter~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {85354#(<= 4 ~counter~0)} is VALID [2022-04-08 00:57:19,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {85354#(<= 4 ~counter~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {85354#(<= 4 ~counter~0)} is VALID [2022-04-08 00:57:19,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {85354#(<= 4 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {85354#(<= 4 ~counter~0)} is VALID [2022-04-08 00:57:19,395 INFO L290 TraceCheckUtils]: 47: Hoare triple {85281#(<= 3 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {85354#(<= 4 ~counter~0)} is VALID [2022-04-08 00:57:19,395 INFO L290 TraceCheckUtils]: 46: Hoare triple {85281#(<= 3 ~counter~0)} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:19,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {85281#(<= 3 ~counter~0)} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:19,396 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {85204#true} {85281#(<= 3 ~counter~0)} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:19,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {85204#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {85204#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {85204#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85204#true} is VALID [2022-04-08 00:57:19,396 INFO L272 TraceCheckUtils]: 40: Hoare triple {85281#(<= 3 ~counter~0)} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {85204#true} is VALID [2022-04-08 00:57:19,397 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {85204#true} {85281#(<= 3 ~counter~0)} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:19,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {85204#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {85204#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {85204#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85204#true} is VALID [2022-04-08 00:57:19,397 INFO L272 TraceCheckUtils]: 35: Hoare triple {85281#(<= 3 ~counter~0)} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {85204#true} is VALID [2022-04-08 00:57:19,398 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {85204#true} {85281#(<= 3 ~counter~0)} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:19,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {85204#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {85204#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {85204#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85204#true} is VALID [2022-04-08 00:57:19,398 INFO L272 TraceCheckUtils]: 30: Hoare triple {85281#(<= 3 ~counter~0)} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {85204#true} is VALID [2022-04-08 00:57:19,398 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {85204#true} {85281#(<= 3 ~counter~0)} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:19,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {85204#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {85204#true} [135] L11-->L11-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {85204#true} [130] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {85204#true} is VALID [2022-04-08 00:57:19,399 INFO L272 TraceCheckUtils]: 25: Hoare triple {85281#(<= 3 ~counter~0)} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {85204#true} is VALID [2022-04-08 00:57:19,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {85281#(<= 3 ~counter~0)} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 10) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:19,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {85271#(<= 2 ~counter~0)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {85281#(<= 3 ~counter~0)} is VALID [2022-04-08 00:57:19,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {85271#(<= 2 ~counter~0)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {85271#(<= 2 ~counter~0)} is VALID [2022-04-08 00:57:19,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {85271#(<= 2 ~counter~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 10) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {85271#(<= 2 ~counter~0)} is VALID [2022-04-08 00:57:19,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {85261#(<= 1 ~counter~0)} [137] L41-3-->L41-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {85271#(<= 2 ~counter~0)} is VALID [2022-04-08 00:57:19,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {85261#(<= 1 ~counter~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {85261#(<= 1 ~counter~0)} is VALID [2022-04-08 00:57:19,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {85261#(<= 1 ~counter~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {85261#(<= 1 ~counter~0)} is VALID [2022-04-08 00:57:19,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {85212#(<= 0 ~counter~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {85261#(<= 1 ~counter~0)} is VALID [2022-04-08 00:57:19,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {85212#(<= 0 ~counter~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:19,405 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {85204#true} {85212#(<= 0 ~counter~0)} [159] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:19,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {85204#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {85204#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {85204#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {85204#true} is VALID [2022-04-08 00:57:19,405 INFO L272 TraceCheckUtils]: 11: Hoare triple {85212#(<= 0 ~counter~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {85204#true} is VALID [2022-04-08 00:57:19,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {85204#true} {85212#(<= 0 ~counter~0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:19,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {85204#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {85204#true} [122] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {85204#true} [119] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {85204#true} is VALID [2022-04-08 00:57:19,406 INFO L272 TraceCheckUtils]: 6: Hoare triple {85212#(<= 0 ~counter~0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {85204#true} is VALID [2022-04-08 00:57:19,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {85212#(<= 0 ~counter~0)} [115] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:19,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {85212#(<= 0 ~counter~0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:19,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85212#(<= 0 ~counter~0)} {85204#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:19,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {85212#(<= 0 ~counter~0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:19,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {85204#true} [113] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (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_7, #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] {85212#(<= 0 ~counter~0)} is VALID [2022-04-08 00:57:19,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {85204#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85204#true} is VALID [2022-04-08 00:57:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 00:57:19,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 00:57:19,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628130801] [2022-04-08 00:57:19,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 00:57:19,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175720560] [2022-04-08 00:57:19,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175720560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 00:57:19,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 00:57:19,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2022-04-08 00:57:19,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769158948] [2022-04-08 00:57:19,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 00:57:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 97 [2022-04-08 00:57:19,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 00:57:19,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-08 00:57:19,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:57:19,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 00:57:19,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 00:57:19,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 00:57:19,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-08 00:57:19,504 INFO L87 Difference]: Start difference. First operand 1624 states and 2204 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-08 00:57:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:57:22,900 INFO L93 Difference]: Finished difference Result 2125 states and 2902 transitions. [2022-04-08 00:57:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 00:57:22,900 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 97 [2022-04-08 00:57:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 00:57:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-08 00:57:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 256 transitions. [2022-04-08 00:57:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-08 00:57:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 256 transitions. [2022-04-08 00:57:22,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 256 transitions. [2022-04-08 00:57:23,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 00:57:23,253 INFO L225 Difference]: With dead ends: 2125 [2022-04-08 00:57:23,253 INFO L226 Difference]: Without dead ends: 1232 [2022-04-08 00:57:23,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2022-04-08 00:57:23,255 INFO L913 BasicCegarLoop]: 156 mSDtfsCounter, 203 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 00:57:23,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 451 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 00:57:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-04-08 00:57:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 925. [2022-04-08 00:57:25,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 00:57:25,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1232 states. Second operand has 925 states, 661 states have (on average 1.1225416036308624) internal successors, (742), 669 states have internal predecessors, (742), 167 states have call successors, (167), 98 states have call predecessors, (167), 96 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-08 00:57:25,202 INFO L74 IsIncluded]: Start isIncluded. First operand 1232 states. Second operand has 925 states, 661 states have (on average 1.1225416036308624) internal successors, (742), 669 states have internal predecessors, (742), 167 states have call successors, (167), 98 states have call predecessors, (167), 96 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-08 00:57:25,202 INFO L87 Difference]: Start difference. First operand 1232 states. Second operand has 925 states, 661 states have (on average 1.1225416036308624) internal successors, (742), 669 states have internal predecessors, (742), 167 states have call successors, (167), 98 states have call predecessors, (167), 96 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-08 00:57:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:57:25,242 INFO L93 Difference]: Finished difference Result 1232 states and 1485 transitions. [2022-04-08 00:57:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1485 transitions. [2022-04-08 00:57:25,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:57:25,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:57:25,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 925 states, 661 states have (on average 1.1225416036308624) internal successors, (742), 669 states have internal predecessors, (742), 167 states have call successors, (167), 98 states have call predecessors, (167), 96 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) Second operand 1232 states. [2022-04-08 00:57:25,245 INFO L87 Difference]: Start difference. First operand has 925 states, 661 states have (on average 1.1225416036308624) internal successors, (742), 669 states have internal predecessors, (742), 167 states have call successors, (167), 98 states have call predecessors, (167), 96 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) Second operand 1232 states. [2022-04-08 00:57:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 00:57:25,286 INFO L93 Difference]: Finished difference Result 1232 states and 1485 transitions. [2022-04-08 00:57:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1485 transitions. [2022-04-08 00:57:25,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 00:57:25,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 00:57:25,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 00:57:25,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 00:57:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 661 states have (on average 1.1225416036308624) internal successors, (742), 669 states have internal predecessors, (742), 167 states have call successors, (167), 98 states have call predecessors, (167), 96 states have return successors, (164), 157 states have call predecessors, (164), 164 states have call successors, (164) [2022-04-08 00:57:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1073 transitions. [2022-04-08 00:57:25,324 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1073 transitions. Word has length 97 [2022-04-08 00:57:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 00:57:25,324 INFO L478 AbstractCegarLoop]: Abstraction has 925 states and 1073 transitions. [2022-04-08 00:57:25,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-04-08 00:57:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1073 transitions. [2022-04-08 00:57:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 00:57:25,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 00:57:25,326 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:57:25,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-08 00:57:25,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:57:25,539 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 00:57:25,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 00:57:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash 672019267, now seen corresponding path program 2 times [2022-04-08 00:57:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 00:57:25,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526763037] [2022-04-08 00:57:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 00:57:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 00:57:25,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 00:57:25,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630927567] [2022-04-08 00:57:25,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 00:57:25,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 00:57:25,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 00:57:25,559 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 00:57:25,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 00:57:25,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 00:57:25,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 00:57:25,658 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 00:57:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 00:57:25,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 00:57:25,774 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 00:57:25,775 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 00:57:25,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 00:57:25,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 00:57:25,998 INFO L719 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 00:57:26,000 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 00:57:26,072 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-08 00:57:26,073 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 00:57:26,073 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 00:57:26,073 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-08 00:57:26,073 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 00:57:26,083 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 00:57:26,083 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 00:57:26,083 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:57:26,083 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:57:26,083 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:57:26,083 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:57:26,083 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 00:57:26,083 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-08 00:57:26,083 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-08 00:57:26,083 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 00:57:26,084 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-08 00:57:26,085 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-08 00:57:26,086 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 00:57:26,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:57:26 BasicIcfg [2022-04-08 00:57:26,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 00:57:26,087 INFO L158 Benchmark]: Toolchain (without parser) took 458686.46ms. Allocated memory was 168.8MB in the beginning and 292.6MB in the end (delta: 123.7MB). Free memory was 113.6MB in the beginning and 92.8MB in the end (delta: 20.9MB). Peak memory consumption was 146.2MB. Max. memory is 8.0GB. [2022-04-08 00:57:26,087 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 168.8MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 00:57:26,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.69ms. Allocated memory is still 168.8MB. Free memory was 113.3MB in the beginning and 142.2MB in the end (delta: -28.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-08 00:57:26,088 INFO L158 Benchmark]: Boogie Preprocessor took 38.63ms. Allocated memory is still 168.8MB. Free memory was 142.2MB in the beginning and 140.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 00:57:26,088 INFO L158 Benchmark]: RCFGBuilder took 345.46ms. Allocated memory is still 168.8MB. Free memory was 140.3MB in the beginning and 127.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 00:57:26,088 INFO L158 Benchmark]: IcfgTransformer took 69.40ms. Allocated memory is still 168.8MB. Free memory was 127.5MB in the beginning and 125.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 00:57:26,088 INFO L158 Benchmark]: TraceAbstraction took 457916.98ms. Allocated memory was 168.8MB in the beginning and 292.6MB in the end (delta: 123.7MB). Free memory was 125.0MB in the beginning and 92.8MB in the end (delta: 32.2MB). Peak memory consumption was 156.9MB. Max. memory is 8.0GB. [2022-04-08 00:57:26,089 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 168.8MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.69ms. Allocated memory is still 168.8MB. Free memory was 113.3MB in the beginning and 142.2MB in the end (delta: -28.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.63ms. Allocated memory is still 168.8MB. Free memory was 142.2MB in the beginning and 140.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 345.46ms. Allocated memory is still 168.8MB. Free memory was 140.3MB in the beginning and 127.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 69.40ms. Allocated memory is still 168.8MB. Free memory was 127.5MB in the beginning and 125.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 457916.98ms. Allocated memory was 168.8MB in the beginning and 292.6MB in the end (delta: 123.7MB). Free memory was 125.0MB in the beginning and 92.8MB in the end (delta: 32.2MB). Peak memory consumption was 156.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=13, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=3, y=5] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=3, y=5] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=3, b=5, counter=0, p=1, q=0, r=0, s=1, x=3, y=5] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=5, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=3, y=5] [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=3, b=5, c=3, counter=1, k=0, p=1, q=0, r=0, s=1, x=3, y=5] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=5, c=3, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=5, c=3, counter=2, k=0, p=1, q=0, r=0, s=1, x=3, y=5] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=5, b=3, c=3, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, y=5] [L34] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, y=5] [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=5, b=3, c=5, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, y=5] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=5, b=3, c=5, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L48] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, counter++=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L48] COND TRUE counter++<10 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=5, b=3, c=5, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=5, b=3, c=2, counter=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=6, counter++=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=6, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=3, x=3, y=5] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=3, x=3, y=5] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=7, counter++=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=3, x=3, y=5] [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=3, x=3, y=5] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=8, counter++=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=3, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=3, b=2, c=3, counter=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L48] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, counter++=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L48] COND TRUE counter++<10 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=3, b=2, c=3, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=3, b=2, c=1, counter=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=10, counter++=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=2, c=1, counter=10, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=3, y=5] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=2, x=3, y=5] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=11, counter++=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=2, x=3, y=5] [L34] COND FALSE !(counter++<10) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 457.8s, OverallIterations: 25, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 227.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 2718 SdHoareTripleChecker+Valid, 52.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2655 mSDsluCounter, 7251 SdHoareTripleChecker+Invalid, 52.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5817 mSDsCounter, 1917 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6781 IncrementalHoareTripleChecker+Invalid, 8704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1917 mSolverCounterUnsat, 1434 mSDtfsCounter, 6781 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2116 GetRequests, 1707 SyntacticMatches, 12 SemanticMatches, 397 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5058 ImplicationChecksByTransitivity, 56.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1624occurred in iteration=23, InterpolantAutomatonStates: 357, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 1355 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 189.8s InterpolantComputationTime, 1264 NumberOfCodeBlocks, 1239 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1898 ConstructedInterpolants, 0 QuantifiedInterpolants, 10640 SizeOfPredicates, 119 NumberOfNonLiveVariables, 3998 ConjunctsInSsa, 488 ConjunctsInUnsatCore, 37 InterpolantComputations, 12 PerfectInterpolantSequences, 1581/1997 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-08 00:57:26,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...