/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/egcd-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:38:55,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:38:55,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:38:55,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:38:55,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:38:55,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:38:55,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:38:55,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:38:55,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:38:55,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:38:55,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:38:55,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:38:55,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:38:55,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:38:55,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:38:55,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:38:55,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:38:55,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:38:55,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:38:55,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:38:55,890 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:38:55,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:38:55,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:38:55,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:38:55,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:38:55,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:38:55,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:38:55,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:38:55,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:38:55,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:38:55,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:38:55,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:38:55,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:38:55,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:38:55,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:38:55,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:38:55,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:38:55,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:38:55,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:38:55,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:38:55,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:38:55,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:38:55,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 23:38:55,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:38:55,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:38:55,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:38:55,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:38:55,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:38:55,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:38:55,933 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:38:55,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:38:55,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:38:55,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:38:55,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:38:55,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:38:55,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:38:55,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:38:55,934 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:38:55,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:38:55,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:38:55,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:38:55,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:38:55,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:38:55,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:38:55,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:38:55,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:38:55,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:38:55,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:38:55,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:38:55,936 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:38:55,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:38:55,944 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:38:55,944 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-27 23:38:56,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:38:56,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:38:56,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:38:56,172 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:38:56,173 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:38:56,173 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound10.c [2022-04-27 23:38:56,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a257434e1/637e792ec1db45538ac3d7fa7d368ea4/FLAGf78c910a7 [2022-04-27 23:38:56,596 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:38:56,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound10.c [2022-04-27 23:38:56,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a257434e1/637e792ec1db45538ac3d7fa7d368ea4/FLAGf78c910a7 [2022-04-27 23:38:56,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a257434e1/637e792ec1db45538ac3d7fa7d368ea4 [2022-04-27 23:38:56,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:38:56,613 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:38:56,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:38:56,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:38:56,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:38:56,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:38:56" (1/1) ... [2022-04-27 23:38:56,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d830db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:56, skipping insertion in model container [2022-04-27 23:38:56,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:38:56" (1/1) ... [2022-04-27 23:38:56,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:38:56,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:38:56,774 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/egcd-ll_unwindbound10.c[489,502] [2022-04-27 23:38:56,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:38:56,796 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:38:56,804 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/egcd-ll_unwindbound10.c[489,502] [2022-04-27 23:38:56,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:38:56,820 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:38:56,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:56 WrapperNode [2022-04-27 23:38:56,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:38:56,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:38:56,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:38:56,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:38:56,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:56" (1/1) ... [2022-04-27 23:38:56,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:56" (1/1) ... [2022-04-27 23:38:56,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:56" (1/1) ... [2022-04-27 23:38:56,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:56" (1/1) ... [2022-04-27 23:38:56,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:56" (1/1) ... [2022-04-27 23:38:56,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:56" (1/1) ... [2022-04-27 23:38:56,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:56" (1/1) ... [2022-04-27 23:38:56,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:38:56,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:38:56,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:38:56,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:38:56,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:56" (1/1) ... [2022-04-27 23:38:56,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:38:56,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:38:56,867 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-27 23:38:56,870 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-27 23:38:56,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:38:56,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:38:56,895 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:38:56,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:38:56,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:38:56,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:38:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:38:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:38:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:38:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:38:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 23:38:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:38:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:38:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:38:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:38:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:38:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:38:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:38:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:38:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:38:56,940 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:38:56,941 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:38:57,105 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:38:57,110 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:38:57,111 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 23:38:57,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:38:57 BoogieIcfgContainer [2022-04-27 23:38:57,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:38:57,113 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:38:57,113 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:38:57,114 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:38:57,116 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:38:57" (1/1) ... [2022-04-27 23:38:57,117 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:38:57,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:38:57 BasicIcfg [2022-04-27 23:38:57,147 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:38:57,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:38:57,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:38:57,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:38:57,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:38:56" (1/4) ... [2022-04-27 23:38:57,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7c475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:38:57, skipping insertion in model container [2022-04-27 23:38:57,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:38:56" (2/4) ... [2022-04-27 23:38:57,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7c475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:38:57, skipping insertion in model container [2022-04-27 23:38:57,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:38:57" (3/4) ... [2022-04-27 23:38:57,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7c475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:38:57, skipping insertion in model container [2022-04-27 23:38:57,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:38:57" (4/4) ... [2022-04-27 23:38:57,156 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound10.cqvasr [2022-04-27 23:38:57,166 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:38:57,167 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:38:57,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:38:57,214 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@537e7c54, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6229702c [2022-04-27 23:38:57,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:38:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:38:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 23:38:57,226 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:38:57,226 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:38:57,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:38:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:38:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2051628946, now seen corresponding path program 1 times [2022-04-27 23:38:57,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:38:57,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566744386] [2022-04-27 23:38:57,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:38:57,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:38:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:38:57,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:38:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:38:57,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 23:38:57,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 23:38:57,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 23:38:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:38:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:38:57,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} [93] 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] {38#true} is VALID [2022-04-27 23:38:57,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [96] 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[] {38#true} is VALID [2022-04-27 23:38:57,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 23:38:57,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {38#true} is VALID [2022-04-27 23:38:57,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 23:38:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:38:57,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} [93] 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] {38#true} is VALID [2022-04-27 23:38:57,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [96] 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[] {38#true} is VALID [2022-04-27 23:38:57,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 23:38:57,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {38#true} is VALID [2022-04-27 23:38:57,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:38:57,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 23:38:57,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 23:38:57,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 23:38:57,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 23:38:57,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {38#true} is VALID [2022-04-27 23:38:57,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {38#true} is VALID [2022-04-27 23:38:57,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} [93] 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] {38#true} is VALID [2022-04-27 23:38:57,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} [96] 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[] {38#true} is VALID [2022-04-27 23:38:57,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 23:38:57,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#true} {38#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {38#true} is VALID [2022-04-27 23:38:57,394 INFO L272 TraceCheckUtils]: 11: Hoare triple {38#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {38#true} is VALID [2022-04-27 23:38:57,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#true} [93] 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] {38#true} is VALID [2022-04-27 23:38:57,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#true} [96] 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[] {38#true} is VALID [2022-04-27 23:38:57,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 23:38:57,394 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38#true} {38#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {38#true} is VALID [2022-04-27 23:38:57,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {38#true} is VALID [2022-04-27 23:38:57,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {38#true} [97] L42-2-->L34-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 23:38:57,396 INFO L272 TraceCheckUtils]: 18: Hoare triple {39#false} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {39#false} is VALID [2022-04-27 23:38:57,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} [104] __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] {39#false} is VALID [2022-04-27 23:38:57,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} [107] 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[] {39#false} is VALID [2022-04-27 23:38:57,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 23:38:57,397 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-27 23:38:57,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:38:57,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566744386] [2022-04-27 23:38:57,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566744386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:38:57,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:38:57,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:38:57,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340129169] [2022-04-27 23:38:57,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:38:57,403 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 23:38:57,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:38:57,407 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:38:57,442 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-27 23:38:57,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:38:57,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:38:57,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:38:57,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:38:57,470 INFO L87 Difference]: Start difference. First operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:38:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:38:57,665 INFO L93 Difference]: Finished difference Result 64 states and 97 transitions. [2022-04-27 23:38:57,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:38:57,666 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 23:38:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:38:57,667 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:38:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-04-27 23:38:57,677 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:38:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-04-27 23:38:57,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 97 transitions. [2022-04-27 23:38:57,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:38:57,788 INFO L225 Difference]: With dead ends: 64 [2022-04-27 23:38:57,789 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 23:38:57,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-27 23:38:57,795 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:38:57,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:38:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 23:38:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-27 23:38:57,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:38:57,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:38:57,820 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:38:57,820 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:38:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:38:57,823 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-27 23:38:57,823 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-27 23:38:57,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:38:57,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:38:57,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 31 states. [2022-04-27 23:38:57,825 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 31 states. [2022-04-27 23:38:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:38:57,827 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-27 23:38:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-27 23:38:57,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:38:57,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:38:57,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:38:57,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:38:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:38:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-27 23:38:57,831 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 22 [2022-04-27 23:38:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:38:57,832 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-27 23:38:57,832 INFO L496 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), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:38:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-27 23:38:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 23:38:57,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:38:57,833 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:38:57,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 23:38:57,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:38:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:38:57,834 INFO L85 PathProgramCache]: Analyzing trace with hash -794581502, now seen corresponding path program 1 times [2022-04-27 23:38:57,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:38:57,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457321273] [2022-04-27 23:38:57,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:38:57,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:38:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:38:57,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:38:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:38:57,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#(= ~counter~0 0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {259#(= ~counter~0 0)} {254#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:38:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:38:57,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} [93] 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] {254#true} is VALID [2022-04-27 23:38:57,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} [96] 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[] {254#true} is VALID [2022-04-27 23:38:57,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-27 23:38:57,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {259#(= ~counter~0 0)} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 23:38:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:38:57,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} [93] 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] {254#true} is VALID [2022-04-27 23:38:57,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} [96] 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[] {254#true} is VALID [2022-04-27 23:38:57,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-27 23:38:57,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {259#(= ~counter~0 0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:38:57,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#(= ~counter~0 0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {259#(= ~counter~0 0)} {254#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {259#(= ~counter~0 0)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#(= ~counter~0 0)} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {259#(= ~counter~0 0)} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {254#true} is VALID [2022-04-27 23:38:57,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#true} [93] 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] {254#true} is VALID [2022-04-27 23:38:57,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#true} [96] 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[] {254#true} is VALID [2022-04-27 23:38:57,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-27 23:38:57,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {254#true} {259#(= ~counter~0 0)} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,923 INFO L272 TraceCheckUtils]: 11: Hoare triple {259#(= ~counter~0 0)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {254#true} is VALID [2022-04-27 23:38:57,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#true} [93] 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] {254#true} is VALID [2022-04-27 23:38:57,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {254#true} [96] 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[] {254#true} is VALID [2022-04-27 23:38:57,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {254#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {254#true} is VALID [2022-04-27 23:38:57,924 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {254#true} {259#(= ~counter~0 0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#(= ~counter~0 0)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {259#(= ~counter~0 0)} is VALID [2022-04-27 23:38:57,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {259#(= ~counter~0 0)} [98] L42-2-->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] {268#(= |main_#t~post6| 0)} is VALID [2022-04-27 23:38:57,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {268#(= |main_#t~post6| 0)} [101] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {255#false} is VALID [2022-04-27 23:38:57,925 INFO L272 TraceCheckUtils]: 19: Hoare triple {255#false} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {255#false} is VALID [2022-04-27 23:38:57,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {255#false} [104] __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] {255#false} is VALID [2022-04-27 23:38:57,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {255#false} [107] 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[] {255#false} is VALID [2022-04-27 23:38:57,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {255#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {255#false} is VALID [2022-04-27 23:38:57,926 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-27 23:38:57,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:38:57,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457321273] [2022-04-27 23:38:57,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457321273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:38:57,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:38:57,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:38:57,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907032630] [2022-04-27 23:38:57,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:38:57,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:38:57,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:38:57,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:38:57,947 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-27 23:38:57,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:38:57,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:38:57,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:38:57,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:38:57,948 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:38:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:38:58,175 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-04-27 23:38:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 23:38:58,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:38:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:38:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:38:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-27 23:38:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:38:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-27 23:38:58,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2022-04-27 23:38:58,228 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-27 23:38:58,231 INFO L225 Difference]: With dead ends: 42 [2022-04-27 23:38:58,231 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 23:38:58,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:38:58,234 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:38:58,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:38:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 23:38:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 23:38:58,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:38:58,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:38:58,238 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:38:58,239 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:38:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:38:58,241 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 23:38:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 23:38:58,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:38:58,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:38:58,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-27 23:38:58,242 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-27 23:38:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:38:58,244 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 23:38:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 23:38:58,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:38:58,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:38:58,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:38:58,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:38:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 23:38:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 23:38:58,247 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2022-04-27 23:38:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:38:58,247 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 23:38:58,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:38:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 23:38:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 23:38:58,248 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:38:58,248 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:38:58,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 23:38:58,248 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:38:58,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:38:58,249 INFO L85 PathProgramCache]: Analyzing trace with hash -793509026, now seen corresponding path program 1 times [2022-04-27 23:38:58,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:38:58,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329830415] [2022-04-27 23:38:58,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:38:58,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:38:58,271 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:38:58,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201406823] [2022-04-27 23:38:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:38:58,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:38:58,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:38:58,272 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-27 23:38:58,283 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-27 23:38:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:38:58,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:38:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:38:58,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:39:02,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 23:39:02,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {452#true} is VALID [2022-04-27 23:39:02,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 23:39:02,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 23:39:02,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 23:39:02,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {452#true} is VALID [2022-04-27 23:39:02,596 INFO L272 TraceCheckUtils]: 6: Hoare triple {452#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {452#true} is VALID [2022-04-27 23:39:02,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#true} [93] 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] {452#true} is VALID [2022-04-27 23:39:02,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#true} [96] 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[] {452#true} is VALID [2022-04-27 23:39:02,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 23:39:02,597 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {452#true} {452#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {452#true} is VALID [2022-04-27 23:39:02,597 INFO L272 TraceCheckUtils]: 11: Hoare triple {452#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {452#true} is VALID [2022-04-27 23:39:02,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#true} [93] 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] {452#true} is VALID [2022-04-27 23:39:02,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#true} [96] 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[] {452#true} is VALID [2022-04-27 23:39:02,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 23:39:02,598 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {452#true} {452#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {452#true} is VALID [2022-04-27 23:39:02,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {452#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 23:39:02,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [98] L42-2-->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] {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 23:39:02,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [102] 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] {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 23:39:02,601 INFO L272 TraceCheckUtils]: 19: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:39:02,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {515#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:39:02,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {519#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {453#false} is VALID [2022-04-27 23:39:02,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {453#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#false} is VALID [2022-04-27 23:39:02,603 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-27 23:39:02,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:39:02,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:39:02,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329830415] [2022-04-27 23:39:02,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:39:02,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201406823] [2022-04-27 23:39:02,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201406823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:39:02,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:39:02,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:39:02,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876760063] [2022-04-27 23:39:02,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:39:02,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 23 [2022-04-27 23:39:02,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:39:02,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-27 23:39:02,619 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-27 23:39:02,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:39:02,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:39:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:39:02,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:39:02,620 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-27 23:39:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:02,810 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-27 23:39:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:39:02,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 23 [2022-04-27 23:39:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:39:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-27 23:39:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 23:39:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-27 23:39:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 23:39:02,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 23:39:02,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:39:02,861 INFO L225 Difference]: With dead ends: 49 [2022-04-27 23:39:02,861 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 23:39:02,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-27 23:39:02,862 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:39:02,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:39:02,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 23:39:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-27 23:39:02,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:39:02,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 23:39:02,868 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 23:39:02,869 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 23:39:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:02,871 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 23:39:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 23:39:02,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:02,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:02,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 23:39:02,872 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 23:39:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:02,874 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 23:39:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 23:39:02,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:02,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:02,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:39:02,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:39:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 23:39:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2022-04-27 23:39:02,877 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2022-04-27 23:39:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:39:02,878 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2022-04-27 23:39:02,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-27 23:39:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-27 23:39:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 23:39:02,878 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:39:02,878 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:39:02,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 23:39:03,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:39:03,096 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:39:03,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:39:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2115229340, now seen corresponding path program 1 times [2022-04-27 23:39:03,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:39:03,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171355495] [2022-04-27 23:39:03,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:03,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:39:03,111 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:39:03,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186860781] [2022-04-27 23:39:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:03,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:39:03,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:39:03,112 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-27 23:39:03,113 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-27 23:39:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:03,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 23:39:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:03,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:39:03,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {767#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-27 23:39:03,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {767#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {767#true} is VALID [2022-04-27 23:39:03,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {767#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-27 23:39:03,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {767#true} {767#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-27 23:39:03,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {767#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-27 23:39:03,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {767#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {767#true} is VALID [2022-04-27 23:39:03,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {767#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {767#true} is VALID [2022-04-27 23:39:03,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {767#true} [93] 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] {793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:39:03,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [96] 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[] {797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:39:03,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {797#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:39:03,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {797#(not (= |assume_abort_if_not_#in~cond| 0))} {767#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {804#(<= 1 main_~x~0)} is VALID [2022-04-27 23:39:03,387 INFO L272 TraceCheckUtils]: 11: Hoare triple {804#(<= 1 main_~x~0)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {767#true} is VALID [2022-04-27 23:39:03,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {767#true} [93] 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] {767#true} is VALID [2022-04-27 23:39:03,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {767#true} [96] 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[] {767#true} is VALID [2022-04-27 23:39:03,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {767#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-27 23:39:03,389 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {767#true} {804#(<= 1 main_~x~0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {804#(<= 1 main_~x~0)} is VALID [2022-04-27 23:39:03,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {804#(<= 1 main_~x~0)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:03,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [98] L42-2-->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] {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:03,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [102] 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] {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:03,391 INFO L272 TraceCheckUtils]: 19: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {767#true} is VALID [2022-04-27 23:39:03,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {767#true} [104] __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] {767#true} is VALID [2022-04-27 23:39:03,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {767#true} [108] 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[] {767#true} is VALID [2022-04-27 23:39:03,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {767#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#true} is VALID [2022-04-27 23:39:03,392 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {767#true} {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:03,394 INFO L272 TraceCheckUtils]: 24: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:39:03,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {848#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:39:03,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {852#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {768#false} is VALID [2022-04-27 23:39:03,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {768#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#false} is VALID [2022-04-27 23:39:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 23:39:03,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:39:34,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:39:34,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171355495] [2022-04-27 23:39:34,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:39:34,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186860781] [2022-04-27 23:39:34,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186860781] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 23:39:34,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:39:34,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 23:39:34,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651995759] [2022-04-27 23:39:34,046 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 23:39:34,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 23:39:34,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:39:34,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:39:34,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:39:34,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 23:39:34,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:39:34,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 23:39:34,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:39:34,068 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:39:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:34,466 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-04-27 23:39:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 23:39:34,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 23:39:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:39:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:39:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-27 23:39:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:39:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-27 23:39:34,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2022-04-27 23:39:34,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:39:34,525 INFO L225 Difference]: With dead ends: 53 [2022-04-27 23:39:34,525 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 23:39:34,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:39:34,526 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:39:34,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 185 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:39:34,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 23:39:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 23:39:34,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:39:34,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 23:39:34,540 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 23:39:34,541 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 23:39:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:34,547 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-27 23:39:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-27 23:39:34,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:34,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:34,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 51 states. [2022-04-27 23:39:34,552 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 51 states. [2022-04-27 23:39:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:34,557 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-27 23:39:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-27 23:39:34,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:34,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:34,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:39:34,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:39:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 23:39:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-04-27 23:39:34,561 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 28 [2022-04-27 23:39:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:39:34,562 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-04-27 23:39:34,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 23:39:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-27 23:39:34,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 23:39:34,563 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:39:34,563 INFO L195 NwaCegarLoop]: 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] [2022-04-27 23:39:34,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 23:39:34,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 23:39:34,768 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:39:34,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:39:34,768 INFO L85 PathProgramCache]: Analyzing trace with hash -864241798, now seen corresponding path program 1 times [2022-04-27 23:39:34,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:39:34,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633652672] [2022-04-27 23:39:34,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:34,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:39:34,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:39:34,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [28087270] [2022-04-27 23:39:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:34,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:39:34,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:39:34,796 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-27 23:39:34,796 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-27 23:39:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:34,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 23:39:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:34,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:39:35,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1136#true} is VALID [2022-04-27 23:39:35,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {1136#true} is VALID [2022-04-27 23:39:35,058 INFO L272 TraceCheckUtils]: 6: Hoare triple {1136#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1136#true} is VALID [2022-04-27 23:39:35,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} [93] 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] {1162#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:39:35,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {1162#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [96] 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[] {1166#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:39:35,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1166#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:39:35,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#(not (= |assume_abort_if_not_#in~cond| 0))} {1136#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1173#(<= 1 main_~x~0)} is VALID [2022-04-27 23:39:35,060 INFO L272 TraceCheckUtils]: 11: Hoare triple {1173#(<= 1 main_~x~0)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {1136#true} is VALID [2022-04-27 23:39:35,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#true} [93] 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] {1136#true} is VALID [2022-04-27 23:39:35,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#true} [96] 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[] {1136#true} is VALID [2022-04-27 23:39:35,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {1136#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,061 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1136#true} {1173#(<= 1 main_~x~0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {1173#(<= 1 main_~x~0)} is VALID [2022-04-27 23:39:35,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#(<= 1 main_~x~0)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:39:35,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [98] L42-2-->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] {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:39:35,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [102] 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] {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:39:35,062 INFO L272 TraceCheckUtils]: 19: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1136#true} is VALID [2022-04-27 23:39:35,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#true} [104] __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] {1136#true} is VALID [2022-04-27 23:39:35,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#true} [108] 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[] {1136#true} is VALID [2022-04-27 23:39:35,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,064 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1136#true} {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:39:35,064 INFO L272 TraceCheckUtils]: 24: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1136#true} is VALID [2022-04-27 23:39:35,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#true} [104] __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] {1136#true} is VALID [2022-04-27 23:39:35,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#true} [108] 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[] {1136#true} is VALID [2022-04-27 23:39:35,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {1136#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,065 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1136#true} {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 23:39:35,066 INFO L272 TraceCheckUtils]: 29: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:39:35,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {1236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:39:35,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {1236#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {1137#false} is VALID [2022-04-27 23:39:35,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {1137#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#false} is VALID [2022-04-27 23:39:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 23:39:35,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:39:35,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {1137#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1137#false} is VALID [2022-04-27 23:39:35,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {1236#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {1137#false} is VALID [2022-04-27 23:39:35,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {1236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:39:35,276 INFO L272 TraceCheckUtils]: 29: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:39:35,277 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1136#true} {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:39:35,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {1136#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#true} [108] 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[] {1136#true} is VALID [2022-04-27 23:39:35,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#true} [104] __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] {1136#true} is VALID [2022-04-27 23:39:35,277 INFO L272 TraceCheckUtils]: 24: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1136#true} is VALID [2022-04-27 23:39:35,278 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1136#true} {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:39:35,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#true} [108] 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[] {1136#true} is VALID [2022-04-27 23:39:35,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#true} [104] __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] {1136#true} is VALID [2022-04-27 23:39:35,278 INFO L272 TraceCheckUtils]: 19: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1136#true} is VALID [2022-04-27 23:39:35,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [102] 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] {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:39:35,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [98] L42-2-->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] {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:39:35,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {1136#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 23:39:35,279 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1136#true} {1136#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {1136#true} is VALID [2022-04-27 23:39:35,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {1136#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#true} [96] 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[] {1136#true} is VALID [2022-04-27 23:39:35,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#true} [93] 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] {1136#true} is VALID [2022-04-27 23:39:35,283 INFO L272 TraceCheckUtils]: 11: Hoare triple {1136#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {1136#true} is VALID [2022-04-27 23:39:35,284 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1136#true} {1136#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1136#true} is VALID [2022-04-27 23:39:35,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {1136#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {1136#true} [96] 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[] {1136#true} is VALID [2022-04-27 23:39:35,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} [93] 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] {1136#true} is VALID [2022-04-27 23:39:35,284 INFO L272 TraceCheckUtils]: 6: Hoare triple {1136#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1136#true} is VALID [2022-04-27 23:39:35,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {1136#true} is VALID [2022-04-27 23:39:35,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1136#true} is VALID [2022-04-27 23:39:35,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1136#true} is VALID [2022-04-27 23:39:35,285 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-27 23:39:35,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:39:35,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633652672] [2022-04-27 23:39:35,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:39:35,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28087270] [2022-04-27 23:39:35,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28087270] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 23:39:35,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:39:35,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 23:39:35,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227979345] [2022-04-27 23:39:35,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:39:35,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 33 [2022-04-27 23:39:35,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:39:35,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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-27 23:39:35,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:39:35,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:39:35,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:39:35,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:39:35,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:39:35,307 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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-27 23:39:35,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:35,645 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2022-04-27 23:39:35,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:39:35,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 33 [2022-04-27 23:39:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:39:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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-27 23:39:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 23:39:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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-27 23:39:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 23:39:35,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 23:39:35,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:39:35,698 INFO L225 Difference]: With dead ends: 75 [2022-04-27 23:39:35,698 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 23:39:35,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 23:39:35,699 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:39:35,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 128 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:39:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 23:39:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-27 23:39:35,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:39:35,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:39:35,729 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:39:35,730 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:39:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:35,755 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-27 23:39:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 23:39:35,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:35,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:35,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 23:39:35,756 INFO L87 Difference]: Start difference. First operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 23:39:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:35,762 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-27 23:39:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 23:39:35,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:35,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:35,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:39:35,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:39:35,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 23:39:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2022-04-27 23:39:35,764 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 33 [2022-04-27 23:39:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:39:35,765 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-04-27 23:39:35,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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-27 23:39:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 23:39:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 23:39:35,765 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:39:35,765 INFO L195 NwaCegarLoop]: 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] [2022-04-27 23:39:35,785 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-27 23:39:35,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:39:35,966 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:39:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:39:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash -120478471, now seen corresponding path program 1 times [2022-04-27 23:39:35,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:39:35,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586335086] [2022-04-27 23:39:35,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:35,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:39:35,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:39:35,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404854005] [2022-04-27 23:39:35,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:35,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:39:35,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:39:35,982 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-27 23:39:35,983 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-27 23:39:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:36,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 23:39:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:36,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:39:36,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {1712#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-27 23:39:36,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {1712#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1712#true} is VALID [2022-04-27 23:39:36,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {1712#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-27 23:39:36,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1712#true} {1712#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-27 23:39:36,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {1712#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-27 23:39:36,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {1712#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {1712#true} is VALID [2022-04-27 23:39:36,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {1712#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1712#true} is VALID [2022-04-27 23:39:36,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {1712#true} [93] 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] {1712#true} is VALID [2022-04-27 23:39:36,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {1712#true} [96] 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[] {1712#true} is VALID [2022-04-27 23:39:36,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {1712#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-27 23:39:36,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1712#true} {1712#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1712#true} is VALID [2022-04-27 23:39:36,130 INFO L272 TraceCheckUtils]: 11: Hoare triple {1712#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {1712#true} is VALID [2022-04-27 23:39:36,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#true} [93] 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] {1712#true} is VALID [2022-04-27 23:39:36,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#true} [96] 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[] {1712#true} is VALID [2022-04-27 23:39:36,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {1712#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-27 23:39:36,130 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1712#true} {1712#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {1712#true} is VALID [2022-04-27 23:39:36,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1712#true} is VALID [2022-04-27 23:39:36,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#true} [98] L42-2-->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] {1712#true} is VALID [2022-04-27 23:39:36,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {1712#true} [102] 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] {1712#true} is VALID [2022-04-27 23:39:36,131 INFO L272 TraceCheckUtils]: 19: Hoare triple {1712#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1712#true} is VALID [2022-04-27 23:39:36,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {1712#true} [104] __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] {1712#true} is VALID [2022-04-27 23:39:36,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {1712#true} [108] 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[] {1712#true} is VALID [2022-04-27 23:39:36,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {1712#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-27 23:39:36,131 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1712#true} {1712#true} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1712#true} is VALID [2022-04-27 23:39:36,131 INFO L272 TraceCheckUtils]: 24: Hoare triple {1712#true} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1712#true} is VALID [2022-04-27 23:39:36,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {1712#true} [104] __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] {1712#true} is VALID [2022-04-27 23:39:36,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {1712#true} [108] 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[] {1712#true} is VALID [2022-04-27 23:39:36,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {1712#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-27 23:39:36,132 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1712#true} {1712#true} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1712#true} is VALID [2022-04-27 23:39:36,132 INFO L272 TraceCheckUtils]: 29: Hoare triple {1712#true} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1712#true} is VALID [2022-04-27 23:39:36,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {1712#true} [104] __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] {1712#true} is VALID [2022-04-27 23:39:36,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {1712#true} [108] 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[] {1712#true} is VALID [2022-04-27 23:39:36,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {1712#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1712#true} is VALID [2022-04-27 23:39:36,132 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1712#true} {1712#true} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1712#true} is VALID [2022-04-27 23:39:36,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {1712#true} [116] L37-->L34-3: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {1819#(= main_~b~0 main_~a~0)} is VALID [2022-04-27 23:39:36,134 INFO L272 TraceCheckUtils]: 35: Hoare triple {1819#(= main_~b~0 main_~a~0)} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:39:36,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {1823#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {1827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:39:36,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {1827#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {1713#false} is VALID [2022-04-27 23:39:36,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {1713#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1713#false} is VALID [2022-04-27 23:39:36,136 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-27 23:39:36,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:39:36,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:39:36,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586335086] [2022-04-27 23:39:36,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:39:36,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404854005] [2022-04-27 23:39:36,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404854005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:39:36,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:39:36,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:39:36,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780165763] [2022-04-27 23:39:36,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:39:36,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-27 23:39:36,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:39:36,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 23:39:36,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:39:36,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:39:36,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:39:36,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:39:36,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:39:36,161 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 23:39:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:36,358 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2022-04-27 23:39:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:39:36,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-27 23:39:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:39:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 23:39:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 23:39:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 23:39:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 23:39:36,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-27 23:39:36,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:39:36,400 INFO L225 Difference]: With dead ends: 87 [2022-04-27 23:39:36,400 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 23:39:36,400 INFO L412 NwaCegarLoop]: 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-27 23:39:36,401 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:39:36,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:39:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 23:39:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-04-27 23:39:36,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:39:36,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 23:39:36,427 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 23:39:36,427 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 23:39:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:36,430 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-04-27 23:39:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2022-04-27 23:39:36,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:36,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:36,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 85 states. [2022-04-27 23:39:36,431 INFO L87 Difference]: Start difference. First operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 85 states. [2022-04-27 23:39:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:36,449 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-04-27 23:39:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2022-04-27 23:39:36,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:36,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:36,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:39:36,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:39:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 23:39:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2022-04-27 23:39:36,452 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 39 [2022-04-27 23:39:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:39:36,453 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2022-04-27 23:39:36,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 23:39:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2022-04-27 23:39:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 23:39:36,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:39:36,453 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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-27 23:39:36,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 23:39:36,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:39:36,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:39:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:39:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1628466672, now seen corresponding path program 1 times [2022-04-27 23:39:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:39:36,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933016424] [2022-04-27 23:39:36,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:36,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:39:36,667 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:39:36,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [680120945] [2022-04-27 23:39:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:36,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:39:36,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:39:36,668 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-27 23:39:36,669 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-27 23:39:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:36,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:39:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:36,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:39:36,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {2263#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-27 23:39:36,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {2271#(<= ~counter~0 0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2271#(<= ~counter~0 0)} {2263#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {2271#(<= ~counter~0 0)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {2271#(<= ~counter~0 0)} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,908 INFO L272 TraceCheckUtils]: 6: Hoare triple {2271#(<= ~counter~0 0)} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {2271#(<= ~counter~0 0)} [93] 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] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {2271#(<= ~counter~0 0)} [96] 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[] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {2271#(<= ~counter~0 0)} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,909 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2271#(<= ~counter~0 0)} {2271#(<= ~counter~0 0)} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,909 INFO L272 TraceCheckUtils]: 11: Hoare triple {2271#(<= ~counter~0 0)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {2271#(<= ~counter~0 0)} [93] 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] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {2271#(<= ~counter~0 0)} [96] 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[] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {2271#(<= ~counter~0 0)} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,910 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2271#(<= ~counter~0 0)} {2271#(<= ~counter~0 0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {2271#(<= ~counter~0 0)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2271#(<= ~counter~0 0)} is VALID [2022-04-27 23:39:36,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {2271#(<= ~counter~0 0)} [98] L42-2-->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] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {2320#(<= ~counter~0 1)} [102] 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] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,912 INFO L272 TraceCheckUtils]: 19: Hoare triple {2320#(<= ~counter~0 1)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {2320#(<= ~counter~0 1)} [104] __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] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {2320#(<= ~counter~0 1)} [108] 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[] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {2320#(<= ~counter~0 1)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,924 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,926 INFO L272 TraceCheckUtils]: 24: Hoare triple {2320#(<= ~counter~0 1)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {2320#(<= ~counter~0 1)} [104] __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] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {2320#(<= ~counter~0 1)} [108] 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[] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {2320#(<= ~counter~0 1)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,928 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,930 INFO L272 TraceCheckUtils]: 29: Hoare triple {2320#(<= ~counter~0 1)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {2320#(<= ~counter~0 1)} [104] __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] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {2320#(<= ~counter~0 1)} [108] 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[] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {2320#(<= ~counter~0 1)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,934 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {2320#(<= ~counter~0 1)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {2320#(<= ~counter~0 1)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {2320#(<= ~counter~0 1)} is VALID [2022-04-27 23:39:36,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {2320#(<= ~counter~0 1)} [98] L42-2-->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] {2378#(<= |main_#t~post6| 1)} is VALID [2022-04-27 23:39:36,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {2378#(<= |main_#t~post6| 1)} [101] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2264#false} is VALID [2022-04-27 23:39:36,936 INFO L272 TraceCheckUtils]: 38: Hoare triple {2264#false} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2264#false} is VALID [2022-04-27 23:39:36,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {2264#false} [104] __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] {2264#false} is VALID [2022-04-27 23:39:36,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {2264#false} [107] 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[] {2264#false} is VALID [2022-04-27 23:39:36,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {2264#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2264#false} is VALID [2022-04-27 23:39:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 23:39:36,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:39:37,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {2264#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2264#false} is VALID [2022-04-27 23:39:37,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {2264#false} [107] 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[] {2264#false} is VALID [2022-04-27 23:39:37,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {2264#false} [104] __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] {2264#false} is VALID [2022-04-27 23:39:37,122 INFO L272 TraceCheckUtils]: 38: Hoare triple {2264#false} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2264#false} is VALID [2022-04-27 23:39:37,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {2406#(< |main_#t~post6| 10)} [101] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2264#false} is VALID [2022-04-27 23:39:37,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {2410#(< ~counter~0 10)} [98] L42-2-->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] {2406#(< |main_#t~post6| 10)} is VALID [2022-04-27 23:39:37,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {2410#(< ~counter~0 10)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {2410#(< ~counter~0 10)} is VALID [2022-04-27 23:39:37,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {2410#(< ~counter~0 10)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2410#(< ~counter~0 10)} is VALID [2022-04-27 23:39:37,124 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2263#true} {2410#(< ~counter~0 10)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2410#(< ~counter~0 10)} is VALID [2022-04-27 23:39:37,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {2263#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-27 23:39:37,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {2263#true} [108] 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[] {2263#true} is VALID [2022-04-27 23:39:37,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {2263#true} [104] __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] {2263#true} is VALID [2022-04-27 23:39:37,124 INFO L272 TraceCheckUtils]: 29: Hoare triple {2410#(< ~counter~0 10)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2263#true} is VALID [2022-04-27 23:39:37,130 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2263#true} {2410#(< ~counter~0 10)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2410#(< ~counter~0 10)} is VALID [2022-04-27 23:39:37,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {2263#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-27 23:39:37,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {2263#true} [108] 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[] {2263#true} is VALID [2022-04-27 23:39:37,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {2263#true} [104] __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] {2263#true} is VALID [2022-04-27 23:39:37,131 INFO L272 TraceCheckUtils]: 24: Hoare triple {2410#(< ~counter~0 10)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2263#true} is VALID [2022-04-27 23:39:37,131 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2263#true} {2410#(< ~counter~0 10)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2410#(< ~counter~0 10)} is VALID [2022-04-27 23:39:37,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {2263#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-27 23:39:37,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {2263#true} [108] 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[] {2263#true} is VALID [2022-04-27 23:39:37,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {2263#true} [104] __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] {2263#true} is VALID [2022-04-27 23:39:37,131 INFO L272 TraceCheckUtils]: 19: Hoare triple {2410#(< ~counter~0 10)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2263#true} is VALID [2022-04-27 23:39:37,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {2410#(< ~counter~0 10)} [102] 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] {2410#(< ~counter~0 10)} is VALID [2022-04-27 23:39:37,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {2468#(< ~counter~0 9)} [98] L42-2-->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] {2410#(< ~counter~0 10)} is VALID [2022-04-27 23:39:37,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {2468#(< ~counter~0 9)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2468#(< ~counter~0 9)} is VALID [2022-04-27 23:39:37,133 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2263#true} {2468#(< ~counter~0 9)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2468#(< ~counter~0 9)} is VALID [2022-04-27 23:39:37,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-27 23:39:37,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {2263#true} [96] 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[] {2263#true} is VALID [2022-04-27 23:39:37,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {2263#true} [93] 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] {2263#true} is VALID [2022-04-27 23:39:37,133 INFO L272 TraceCheckUtils]: 11: Hoare triple {2468#(< ~counter~0 9)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2263#true} is VALID [2022-04-27 23:39:37,134 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2263#true} {2468#(< ~counter~0 9)} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2468#(< ~counter~0 9)} is VALID [2022-04-27 23:39:37,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {2263#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-27 23:39:37,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {2263#true} [96] 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[] {2263#true} is VALID [2022-04-27 23:39:37,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {2263#true} [93] 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] {2263#true} is VALID [2022-04-27 23:39:37,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {2468#(< ~counter~0 9)} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2263#true} is VALID [2022-04-27 23:39:37,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {2468#(< ~counter~0 9)} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {2468#(< ~counter~0 9)} is VALID [2022-04-27 23:39:37,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {2468#(< ~counter~0 9)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#(< ~counter~0 9)} is VALID [2022-04-27 23:39:37,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2468#(< ~counter~0 9)} {2263#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#(< ~counter~0 9)} is VALID [2022-04-27 23:39:37,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {2468#(< ~counter~0 9)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#(< ~counter~0 9)} is VALID [2022-04-27 23:39:37,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {2468#(< ~counter~0 9)} is VALID [2022-04-27 23:39:37,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {2263#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2263#true} is VALID [2022-04-27 23:39:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 23:39:37,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:39:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933016424] [2022-04-27 23:39:37,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:39:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680120945] [2022-04-27 23:39:37,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680120945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:39:37,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:39:37,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 23:39:37,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807302718] [2022-04-27 23:39:37,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:39:37,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2022-04-27 23:39:37,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:39:37,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 23:39:37,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:39:37,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 23:39:37,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:39:37,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 23:39:37,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 23:39:37,187 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 23:39:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:37,612 INFO L93 Difference]: Finished difference Result 222 states and 290 transitions. [2022-04-27 23:39:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 23:39:37,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 42 [2022-04-27 23:39:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:39:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 23:39:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-04-27 23:39:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 23:39:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-04-27 23:39:37,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 124 transitions. [2022-04-27 23:39:37,713 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-27 23:39:37,717 INFO L225 Difference]: With dead ends: 222 [2022-04-27 23:39:37,717 INFO L226 Difference]: Without dead ends: 200 [2022-04-27 23:39:37,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:39:37,718 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 62 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:39:37,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 222 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:39:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-27 23:39:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2022-04-27 23:39:37,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:39:37,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 23:39:37,809 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 23:39:37,810 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 23:39:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:37,822 INFO L93 Difference]: Finished difference Result 200 states and 254 transitions. [2022-04-27 23:39:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 254 transitions. [2022-04-27 23:39:37,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:37,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:37,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 200 states. [2022-04-27 23:39:37,831 INFO L87 Difference]: Start difference. First operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 200 states. [2022-04-27 23:39:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:37,837 INFO L93 Difference]: Finished difference Result 200 states and 254 transitions. [2022-04-27 23:39:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 254 transitions. [2022-04-27 23:39:37,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:37,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:37,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:39:37,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:39:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 120 states have internal predecessors, (133), 63 states have call successors, (63), 23 states have call predecessors, (63), 21 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 23:39:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 251 transitions. [2022-04-27 23:39:37,844 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 251 transitions. Word has length 42 [2022-04-27 23:39:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:39:37,844 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 251 transitions. [2022-04-27 23:39:37,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-27 23:39:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 251 transitions. [2022-04-27 23:39:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 23:39:37,845 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:39:37,845 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:39:37,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 23:39:38,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:39:38,059 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:39:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:39:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1627394196, now seen corresponding path program 1 times [2022-04-27 23:39:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:39:38,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616293683] [2022-04-27 23:39:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:39:38,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:39:38,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1367698571] [2022-04-27 23:39:38,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:38,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:39:38,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:39:38,072 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-27 23:39:38,073 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-27 23:39:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:38,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 23:39:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:38,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:39:39,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {3552#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3552#true} is VALID [2022-04-27 23:39:39,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {3552#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {3552#true} is VALID [2022-04-27 23:39:39,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {3552#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3552#true} is VALID [2022-04-27 23:39:39,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3552#true} {3552#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3552#true} is VALID [2022-04-27 23:39:39,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {3552#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3552#true} is VALID [2022-04-27 23:39:39,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {3552#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {3552#true} is VALID [2022-04-27 23:39:39,835 INFO L272 TraceCheckUtils]: 6: Hoare triple {3552#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3552#true} is VALID [2022-04-27 23:39:39,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {3552#true} [93] 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] {3552#true} is VALID [2022-04-27 23:39:39,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {3552#true} [96] 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[] {3552#true} is VALID [2022-04-27 23:39:39,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {3552#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3552#true} is VALID [2022-04-27 23:39:39,835 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3552#true} {3552#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3552#true} is VALID [2022-04-27 23:39:39,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {3552#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {3552#true} is VALID [2022-04-27 23:39:39,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {3552#true} [93] 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] {3552#true} is VALID [2022-04-27 23:39:39,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {3552#true} [96] 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[] {3552#true} is VALID [2022-04-27 23:39:39,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {3552#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3552#true} is VALID [2022-04-27 23:39:39,836 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3552#true} {3552#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {3552#true} is VALID [2022-04-27 23:39:39,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {3552#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:39,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [98] L42-2-->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] {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:39,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [102] 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] {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:39,837 INFO L272 TraceCheckUtils]: 19: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3552#true} is VALID [2022-04-27 23:39:39,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {3552#true} [104] __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] {3552#true} is VALID [2022-04-27 23:39:39,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {3552#true} [108] 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[] {3552#true} is VALID [2022-04-27 23:39:39,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {3552#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3552#true} is VALID [2022-04-27 23:39:39,838 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3552#true} {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:39,838 INFO L272 TraceCheckUtils]: 24: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3552#true} is VALID [2022-04-27 23:39:39,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {3552#true} [104] __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] {3552#true} is VALID [2022-04-27 23:39:39,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {3552#true} [108] 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[] {3552#true} is VALID [2022-04-27 23:39:39,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {3552#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3552#true} is VALID [2022-04-27 23:39:39,839 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3552#true} {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:39,839 INFO L272 TraceCheckUtils]: 29: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3552#true} is VALID [2022-04-27 23:39:39,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {3552#true} [104] __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] {3552#true} is VALID [2022-04-27 23:39:39,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {3552#true} [108] 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[] {3552#true} is VALID [2022-04-27 23:39:39,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {3552#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3552#true} is VALID [2022-04-27 23:39:39,840 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3552#true} {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:39,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:39,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:39,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [98] L42-2-->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] {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:39,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [102] 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] {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:39:39,842 INFO L272 TraceCheckUtils]: 38: Hoare triple {3605#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:39:39,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {3672#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {3676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:39:39,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {3676#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {3553#false} is VALID [2022-04-27 23:39:39,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {3553#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3553#false} is VALID [2022-04-27 23:39:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 23:39:39,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:39:39,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:39:39,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616293683] [2022-04-27 23:39:39,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:39:39,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367698571] [2022-04-27 23:39:39,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367698571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:39:39,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:39:39,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:39:39,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430168495] [2022-04-27 23:39:39,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:39:39,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 42 [2022-04-27 23:39:39,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:39:39,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-27 23:39:39,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:39:39,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:39:39,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:39:39,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:39:39,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:39:39,881 INFO L87 Difference]: Start difference. First operand 194 states and 251 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-27 23:39:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:40,130 INFO L93 Difference]: Finished difference Result 208 states and 264 transitions. [2022-04-27 23:39:40,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:39:40,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 42 [2022-04-27 23:39:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:39:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-27 23:39:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-27 23:39:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-27 23:39:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-27 23:39:40,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-27 23:39:40,174 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-27 23:39:40,178 INFO L225 Difference]: With dead ends: 208 [2022-04-27 23:39:40,178 INFO L226 Difference]: Without dead ends: 203 [2022-04-27 23:39:40,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:39:40,179 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:39:40,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:39:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-27 23:39:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-04-27 23:39:40,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:39:40,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 23:39:40,267 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 23:39:40,293 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 23:39:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:40,300 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2022-04-27 23:39:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 254 transitions. [2022-04-27 23:39:40,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:40,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:40,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 203 states. [2022-04-27 23:39:40,301 INFO L87 Difference]: Start difference. First operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 203 states. [2022-04-27 23:39:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:39:40,307 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2022-04-27 23:39:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 254 transitions. [2022-04-27 23:39:40,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:39:40,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:39:40,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:39:40,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:39:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 118 states have (on average 1.2033898305084745) internal successors, (142), 129 states have internal predecessors, (142), 60 states have call successors, (60), 26 states have call predecessors, (60), 24 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 23:39:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 254 transitions. [2022-04-27 23:39:40,316 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 254 transitions. Word has length 42 [2022-04-27 23:39:40,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:39:40,317 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 254 transitions. [2022-04-27 23:39:40,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-27 23:39:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 254 transitions. [2022-04-27 23:39:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 23:39:40,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:39:40,317 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-04-27 23:39:40,334 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-27 23:39:40,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:39:40,519 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:39:40,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:39:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1527150038, now seen corresponding path program 1 times [2022-04-27 23:39:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:39:40,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020669307] [2022-04-27 23:39:40,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:40,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:39:40,528 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:39:40,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [909433930] [2022-04-27 23:39:40,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:39:40,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:39:40,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:39:40,529 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-27 23:39:40,530 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-27 23:39:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:40,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 23:39:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:39:40,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:39:40,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {4700#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:40,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {4700#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4700#true} is VALID [2022-04-27 23:39:40,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {4700#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:40,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4700#true} {4700#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:40,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {4700#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:40,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {4700#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {4700#true} is VALID [2022-04-27 23:39:40,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {4700#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {4700#true} is VALID [2022-04-27 23:39:40,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {4700#true} [93] 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] {4700#true} is VALID [2022-04-27 23:39:40,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {4700#true} [96] 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[] {4700#true} is VALID [2022-04-27 23:39:40,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {4700#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:40,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4700#true} {4700#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {4700#true} is VALID [2022-04-27 23:39:40,695 INFO L272 TraceCheckUtils]: 11: Hoare triple {4700#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {4700#true} [93] 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] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {4700#true} [96] 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[] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {4700#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4700#true} {4700#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {4700#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {4700#true} [98] L42-2-->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] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {4700#true} [102] 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] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L272 TraceCheckUtils]: 19: Hoare triple {4700#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {4700#true} [104] __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] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {4700#true} [108] 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[] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {4700#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4700#true} {4700#true} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4700#true} is VALID [2022-04-27 23:39:40,696 INFO L272 TraceCheckUtils]: 24: Hoare triple {4700#true} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4700#true} is VALID [2022-04-27 23:39:40,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {4700#true} [104] __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] {4780#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:39:40,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {4780#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [108] 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[] {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:39:40,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:39:40,702 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} {4700#true} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:39:40,702 INFO L272 TraceCheckUtils]: 29: Hoare triple {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4700#true} is VALID [2022-04-27 23:39:40,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {4700#true} [104] __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] {4700#true} is VALID [2022-04-27 23:39:40,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {4700#true} [108] 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[] {4700#true} is VALID [2022-04-27 23:39:40,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {4700#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:40,703 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4700#true} {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:39:40,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [116] L37-->L34-3: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:39:40,706 INFO L272 TraceCheckUtils]: 35: Hoare triple {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {4700#true} is VALID [2022-04-27 23:39:40,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {4700#true} [104] __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] {4700#true} is VALID [2022-04-27 23:39:40,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {4700#true} [108] 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[] {4700#true} is VALID [2022-04-27 23:39:40,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {4700#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:40,706 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4700#true} {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [127] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:39:40,707 INFO L272 TraceCheckUtils]: 40: Hoare triple {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [103] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~r~0_12 v_main_~y~0_13) (* v_main_~p~0_12 v_main_~x~0_13)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {4829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:39:40,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {4829#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {4833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:39:40,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {4833#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {4701#false} is VALID [2022-04-27 23:39:40,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {4701#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4701#false} is VALID [2022-04-27 23:39:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 23:39:40,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:39:59,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {4701#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4701#false} is VALID [2022-04-27 23:39:59,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {4833#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {4701#false} is VALID [2022-04-27 23:39:59,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {4829#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {4833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:39:59,252 INFO L272 TraceCheckUtils]: 40: Hoare triple {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [103] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~r~0_12 v_main_~y~0_13) (* v_main_~p~0_12 v_main_~x~0_13)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {4829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:39:59,253 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4700#true} {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [127] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:39:59,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {4700#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:59,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {4700#true} [108] 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[] {4700#true} is VALID [2022-04-27 23:39:59,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {4700#true} [104] __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] {4700#true} is VALID [2022-04-27 23:39:59,253 INFO L272 TraceCheckUtils]: 35: Hoare triple {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {4700#true} is VALID [2022-04-27 23:39:59,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [116] L37-->L34-3: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {4810#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:39:59,254 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4700#true} {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:39:59,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {4700#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:59,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {4700#true} [108] 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[] {4700#true} is VALID [2022-04-27 23:39:59,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {4700#true} [104] __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] {4700#true} is VALID [2022-04-27 23:39:59,254 INFO L272 TraceCheckUtils]: 29: Hoare triple {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {4700#true} is VALID [2022-04-27 23:39:59,255 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} {4700#true} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4791#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:39:59,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:39:59,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {4894#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [108] 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[] {4784#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:39:59,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {4700#true} [104] __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] {4894#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:39:59,256 INFO L272 TraceCheckUtils]: 24: Hoare triple {4700#true} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {4700#true} is VALID [2022-04-27 23:39:59,256 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4700#true} {4700#true} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4700#true} is VALID [2022-04-27 23:39:59,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {4700#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:59,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {4700#true} [108] 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[] {4700#true} is VALID [2022-04-27 23:39:59,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {4700#true} [104] __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] {4700#true} is VALID [2022-04-27 23:39:59,256 INFO L272 TraceCheckUtils]: 19: Hoare triple {4700#true} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {4700#true} is VALID [2022-04-27 23:39:59,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {4700#true} [102] 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] {4700#true} is VALID [2022-04-27 23:39:59,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {4700#true} [98] L42-2-->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] {4700#true} is VALID [2022-04-27 23:39:59,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {4700#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4700#true} {4700#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {4700#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {4700#true} [96] 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[] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {4700#true} [93] 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] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L272 TraceCheckUtils]: 11: Hoare triple {4700#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4700#true} {4700#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {4700#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {4700#true} [96] 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[] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {4700#true} [93] 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] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {4700#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {4700#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {4700#true} is VALID [2022-04-27 23:39:59,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {4700#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:59,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4700#true} {4700#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:59,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {4700#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:59,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {4700#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {4700#true} is VALID [2022-04-27 23:39:59,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {4700#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4700#true} is VALID [2022-04-27 23:39:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 23:39:59,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:39:59,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020669307] [2022-04-27 23:39:59,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:39:59,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909433930] [2022-04-27 23:39:59,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909433930] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:39:59,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:39:59,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 23:39:59,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378254446] [2022-04-27 23:39:59,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:39:59,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-27 23:39:59,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:39:59,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 23:39:59,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:39:59,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 23:39:59,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:39:59,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 23:39:59,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:39:59,288 INFO L87 Difference]: Start difference. First operand 203 states and 254 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 23:40:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:00,008 INFO L93 Difference]: Finished difference Result 232 states and 290 transitions. [2022-04-27 23:40:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 23:40:00,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-27 23:40:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:40:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 23:40:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-04-27 23:40:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 23:40:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-04-27 23:40:00,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 60 transitions. [2022-04-27 23:40:00,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:40:00,081 INFO L225 Difference]: With dead ends: 232 [2022-04-27 23:40:00,081 INFO L226 Difference]: Without dead ends: 216 [2022-04-27 23:40:00,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:40:00,082 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 23:40:00,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 141 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 23:40:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-27 23:40:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2022-04-27 23:40:00,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:40:00,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 23:40:00,167 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 23:40:00,167 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 23:40:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:00,173 INFO L93 Difference]: Finished difference Result 216 states and 265 transitions. [2022-04-27 23:40:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 265 transitions. [2022-04-27 23:40:00,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:40:00,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:40:00,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) Second operand 216 states. [2022-04-27 23:40:00,174 INFO L87 Difference]: Start difference. First operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) Second operand 216 states. [2022-04-27 23:40:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:00,180 INFO L93 Difference]: Finished difference Result 216 states and 265 transitions. [2022-04-27 23:40:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 265 transitions. [2022-04-27 23:40:00,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:40:00,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:40:00,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:40:00,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:40:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 128 states have (on average 1.1640625) internal successors, (149), 139 states have internal predecessors, (149), 59 states have call successors, (59), 27 states have call predecessors, (59), 26 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 23:40:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2022-04-27 23:40:00,186 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 44 [2022-04-27 23:40:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:40:00,186 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2022-04-27 23:40:00,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 23:40:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2022-04-27 23:40:00,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 23:40:00,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:40:00,186 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-04-27 23:40:00,203 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-27 23:40:00,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:40:00,399 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:40:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:40:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1237367986, now seen corresponding path program 2 times [2022-04-27 23:40:00,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:40:00,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175015425] [2022-04-27 23:40:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:40:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:40:00,408 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:40:00,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467092197] [2022-04-27 23:40:00,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 23:40:00,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:40:00,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:40:00,410 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-27 23:40:00,411 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-27 23:40:00,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 23:40:00,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 23:40:00,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 23:40:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:40:00,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:40:00,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {6070#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {6070#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {6070#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6070#true} {6070#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {6070#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {6070#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L272 TraceCheckUtils]: 6: Hoare triple {6070#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {6070#true} [93] 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] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {6070#true} [96] 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[] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {6070#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6070#true} {6070#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L272 TraceCheckUtils]: 11: Hoare triple {6070#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {6070#true} [93] 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] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {6070#true} [96] 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[] {6070#true} is VALID [2022-04-27 23:40:00,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {6070#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:00,682 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6070#true} {6070#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {6070#true} is VALID [2022-04-27 23:40:00,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {6070#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6123#(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-27 23:40:00,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {6123#(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))} [98] L42-2-->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] {6123#(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-27 23:40:00,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {6123#(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))} [102] 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] {6123#(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-27 23:40:00,683 INFO L272 TraceCheckUtils]: 19: Hoare triple {6123#(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))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6070#true} is VALID [2022-04-27 23:40:00,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {6070#true} [104] __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] {6070#true} is VALID [2022-04-27 23:40:00,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {6070#true} [108] 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[] {6070#true} is VALID [2022-04-27 23:40:00,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {6070#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:00,683 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6070#true} {6123#(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] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6123#(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-27 23:40:00,684 INFO L272 TraceCheckUtils]: 24: Hoare triple {6123#(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))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6070#true} is VALID [2022-04-27 23:40:00,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {6070#true} [104] __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] {6070#true} is VALID [2022-04-27 23:40:00,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {6070#true} [108] 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[] {6070#true} is VALID [2022-04-27 23:40:00,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {6070#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:00,684 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6070#true} {6123#(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))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6123#(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-27 23:40:00,684 INFO L272 TraceCheckUtils]: 29: Hoare triple {6123#(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))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6070#true} is VALID [2022-04-27 23:40:00,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {6070#true} [104] __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] {6070#true} is VALID [2022-04-27 23:40:00,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {6070#true} [108] 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[] {6070#true} is VALID [2022-04-27 23:40:00,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {6070#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:00,685 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6070#true} {6123#(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))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6123#(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-27 23:40:00,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {6123#(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))} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {6123#(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-27 23:40:00,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {6123#(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))} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 23:40:00,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} [98] L42-2-->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] {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 23:40:00,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} [102] 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] {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 23:40:00,687 INFO L272 TraceCheckUtils]: 38: Hoare triple {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6070#true} is VALID [2022-04-27 23:40:00,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {6070#true} [104] __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] {6070#true} is VALID [2022-04-27 23:40:00,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {6070#true} [108] 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[] {6070#true} is VALID [2022-04-27 23:40:00,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {6070#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:00,687 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6070#true} {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 23:40:00,688 INFO L272 TraceCheckUtils]: 43: Hoare triple {6181#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:40:00,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {6206#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {6210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:40:00,688 INFO L290 TraceCheckUtils]: 45: Hoare triple {6210#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {6071#false} is VALID [2022-04-27 23:40:00,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {6071#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6071#false} is VALID [2022-04-27 23:40:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 23:40:00,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:40:00,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {6071#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6071#false} is VALID [2022-04-27 23:40:00,878 INFO L290 TraceCheckUtils]: 45: Hoare triple {6210#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {6071#false} is VALID [2022-04-27 23:40:00,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {6206#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {6210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:40:00,879 INFO L272 TraceCheckUtils]: 43: Hoare triple {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:40:00,879 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6070#true} {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:40:00,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {6070#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:00,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {6070#true} [108] 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[] {6070#true} is VALID [2022-04-27 23:40:00,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {6070#true} [104] __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] {6070#true} is VALID [2022-04-27 23:40:00,879 INFO L272 TraceCheckUtils]: 38: Hoare triple {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6070#true} is VALID [2022-04-27 23:40:00,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [102] 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] {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:40:00,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [98] L42-2-->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] {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:40:01,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {6226#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 23:40:01,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 23:40:01,171 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6070#true} {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 23:40:01,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {6070#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:01,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {6070#true} [108] 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[] {6070#true} is VALID [2022-04-27 23:40:01,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {6070#true} [104] __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] {6070#true} is VALID [2022-04-27 23:40:01,171 INFO L272 TraceCheckUtils]: 29: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6070#true} is VALID [2022-04-27 23:40:01,172 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6070#true} {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 23:40:01,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {6070#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:01,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {6070#true} [108] 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[] {6070#true} is VALID [2022-04-27 23:40:01,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {6070#true} [104] __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] {6070#true} is VALID [2022-04-27 23:40:01,172 INFO L272 TraceCheckUtils]: 24: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6070#true} is VALID [2022-04-27 23:40:01,172 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6070#true} {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 23:40:01,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {6070#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:01,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {6070#true} [108] 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[] {6070#true} is VALID [2022-04-27 23:40:01,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {6070#true} [104] __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] {6070#true} is VALID [2022-04-27 23:40:01,173 INFO L272 TraceCheckUtils]: 19: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {6070#true} is VALID [2022-04-27 23:40:01,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [102] 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] {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 23:40:01,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [98] L42-2-->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] {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 23:40:01,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {6070#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6251#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 23:40:01,174 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6070#true} {6070#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {6070#true} is VALID [2022-04-27 23:40:01,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {6070#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:01,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {6070#true} [96] 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[] {6070#true} is VALID [2022-04-27 23:40:01,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {6070#true} [93] 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] {6070#true} is VALID [2022-04-27 23:40:01,174 INFO L272 TraceCheckUtils]: 11: Hoare triple {6070#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {6070#true} is VALID [2022-04-27 23:40:01,174 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6070#true} {6070#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {6070#true} is VALID [2022-04-27 23:40:01,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {6070#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:01,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {6070#true} [96] 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[] {6070#true} is VALID [2022-04-27 23:40:01,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {6070#true} [93] 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] {6070#true} is VALID [2022-04-27 23:40:01,174 INFO L272 TraceCheckUtils]: 6: Hoare triple {6070#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {6070#true} is VALID [2022-04-27 23:40:01,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {6070#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {6070#true} is VALID [2022-04-27 23:40:01,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {6070#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:01,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6070#true} {6070#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:01,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {6070#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:01,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {6070#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {6070#true} is VALID [2022-04-27 23:40:01,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {6070#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6070#true} is VALID [2022-04-27 23:40:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 23:40:01,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:40:01,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175015425] [2022-04-27 23:40:01,175 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:40:01,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467092197] [2022-04-27 23:40:01,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467092197] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:40:01,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:40:01,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 23:40:01,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077732174] [2022-04-27 23:40:01,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:40:01,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 47 [2022-04-27 23:40:01,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:40:01,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 23:40:01,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:40:01,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 23:40:01,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:40:01,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 23:40:01,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 23:40:01,298 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 23:40:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:02,771 INFO L93 Difference]: Finished difference Result 253 states and 314 transitions. [2022-04-27 23:40:02,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 23:40:02,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 47 [2022-04-27 23:40:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:40:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 23:40:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 23:40:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 23:40:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 23:40:02,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2022-04-27 23:40:03,080 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-27 23:40:03,085 INFO L225 Difference]: With dead ends: 253 [2022-04-27 23:40:03,085 INFO L226 Difference]: Without dead ends: 229 [2022-04-27 23:40:03,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 23:40:03,086 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 23:40:03,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 152 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 23:40:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-04-27 23:40:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 210. [2022-04-27 23:40:03,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:40:03,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:40:03,170 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:40:03,170 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:40:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:03,175 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2022-04-27 23:40:03,175 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 273 transitions. [2022-04-27 23:40:03,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:40:03,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:40:03,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) Second operand 229 states. [2022-04-27 23:40:03,177 INFO L87 Difference]: Start difference. First operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) Second operand 229 states. [2022-04-27 23:40:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:03,181 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2022-04-27 23:40:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 273 transitions. [2022-04-27 23:40:03,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:40:03,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:40:03,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:40:03,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:40:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 134 states have (on average 1.126865671641791) internal successors, (151), 142 states have internal predecessors, (151), 47 states have call successors, (47), 29 states have call predecessors, (47), 28 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-27 23:40:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 240 transitions. [2022-04-27 23:40:03,186 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 240 transitions. Word has length 47 [2022-04-27 23:40:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:40:03,186 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 240 transitions. [2022-04-27 23:40:03,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 23:40:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 240 transitions. [2022-04-27 23:40:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 23:40:03,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:40:03,187 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 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-27 23:40:03,216 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-27 23:40:03,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 23:40:03,403 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:40:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:40:03,404 INFO L85 PathProgramCache]: Analyzing trace with hash -264996897, now seen corresponding path program 1 times [2022-04-27 23:40:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:40:03,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153717966] [2022-04-27 23:40:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:40:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:40:03,425 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:40:03,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229079658] [2022-04-27 23:40:03,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:40:03,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:40:03,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:40:03,427 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-27 23:40:03,452 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-27 23:40:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:40:03,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 23:40:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:40:03,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:40:03,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {7497#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {7497#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {7497#true} is VALID [2022-04-27 23:40:03,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {7497#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7497#true} {7497#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {7497#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {7497#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {7497#true} is VALID [2022-04-27 23:40:03,821 INFO L272 TraceCheckUtils]: 6: Hoare triple {7497#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {7497#true} is VALID [2022-04-27 23:40:03,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {7497#true} [93] 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] {7497#true} is VALID [2022-04-27 23:40:03,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {7497#true} [96] 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[] {7497#true} is VALID [2022-04-27 23:40:03,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {7497#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,821 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7497#true} {7497#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {7497#true} is VALID [2022-04-27 23:40:03,821 INFO L272 TraceCheckUtils]: 11: Hoare triple {7497#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {7497#true} is VALID [2022-04-27 23:40:03,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {7497#true} [93] 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] {7497#true} is VALID [2022-04-27 23:40:03,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {7497#true} [96] 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[] {7497#true} is VALID [2022-04-27 23:40:03,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {7497#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,821 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7497#true} {7497#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {7497#true} is VALID [2022-04-27 23:40:03,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {7497#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:40:03,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [98] L42-2-->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] {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:40:03,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [102] 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] {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:40:03,822 INFO L272 TraceCheckUtils]: 19: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {7497#true} is VALID [2022-04-27 23:40:03,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:03,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:03,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,823 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7497#true} {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:40:03,823 INFO L272 TraceCheckUtils]: 24: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7497#true} is VALID [2022-04-27 23:40:03,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:03,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:03,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,823 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7497#true} {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:40:03,824 INFO L272 TraceCheckUtils]: 29: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7497#true} is VALID [2022-04-27 23:40:03,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:03,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:03,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,824 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7497#true} {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:40:03,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 23:40:03,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {7550#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 23:40:03,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [98] L42-2-->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] {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 23:40:03,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [102] 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] {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 23:40:03,826 INFO L272 TraceCheckUtils]: 38: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {7497#true} is VALID [2022-04-27 23:40:03,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:03,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:03,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,826 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7497#true} {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 23:40:03,826 INFO L272 TraceCheckUtils]: 43: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7497#true} is VALID [2022-04-27 23:40:03,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:03,827 INFO L290 TraceCheckUtils]: 45: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:03,827 INFO L290 TraceCheckUtils]: 46: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,827 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7497#true} {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 23:40:03,827 INFO L272 TraceCheckUtils]: 48: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7497#true} is VALID [2022-04-27 23:40:03,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:03,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:03,827 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:03,828 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7497#true} {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 23:40:03,828 INFO L290 TraceCheckUtils]: 53: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 23:40:03,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {7608#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [120] L42-->L42-2: Formula: (and (not (< v_main_~b~0_3 v_main_~a~0_3)) (= v_main_~b~0_2 (+ (* (- 1) v_main_~a~0_3) v_main_~b~0_3)) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, 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_3} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-27 23:40:03,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} [98] L42-2-->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] {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-27 23:40:03,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} [102] 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] {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} is VALID [2022-04-27 23:40:03,830 INFO L272 TraceCheckUtils]: 57: Hoare triple {7666#(and (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= main_~q~0 (* (- 1) main_~p~0)) (= main_~p~0 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {7676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:40:03,830 INFO L290 TraceCheckUtils]: 58: Hoare triple {7676#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {7680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:40:03,830 INFO L290 TraceCheckUtils]: 59: Hoare triple {7680#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {7498#false} is VALID [2022-04-27 23:40:03,830 INFO L290 TraceCheckUtils]: 60: Hoare triple {7498#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7498#false} is VALID [2022-04-27 23:40:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 23:40:03,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:40:04,032 INFO L290 TraceCheckUtils]: 60: Hoare triple {7498#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7498#false} is VALID [2022-04-27 23:40:04,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {7680#(<= 1 __VERIFIER_assert_~cond)} [107] 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[] {7498#false} is VALID [2022-04-27 23:40:04,033 INFO L290 TraceCheckUtils]: 58: Hoare triple {7676#(<= 1 |__VERIFIER_assert_#in~cond|)} [104] __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] {7680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:40:04,033 INFO L272 TraceCheckUtils]: 57: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {7676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:40:04,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [102] 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] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [98] L42-2-->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] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,037 INFO L290 TraceCheckUtils]: 54: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [120] L42-->L42-2: Formula: (and (not (< v_main_~b~0_3 v_main_~a~0_3)) (= v_main_~b~0_2 (+ (* (- 1) v_main_~a~0_3) v_main_~b~0_3)) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, 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_3} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,037 INFO L290 TraceCheckUtils]: 53: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,038 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:04,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:04,038 INFO L272 TraceCheckUtils]: 48: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7497#true} is VALID [2022-04-27 23:40:04,039 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:04,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:04,039 INFO L272 TraceCheckUtils]: 43: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7497#true} is VALID [2022-04-27 23:40:04,039 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:04,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:04,039 INFO L272 TraceCheckUtils]: 38: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {7497#true} is VALID [2022-04-27 23:40:04,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [102] 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] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [98] L42-2-->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] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,043 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:04,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:04,044 INFO L272 TraceCheckUtils]: 29: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {7497#true} is VALID [2022-04-27 23:40:04,044 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:04,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:04,044 INFO L272 TraceCheckUtils]: 24: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {7497#true} is VALID [2022-04-27 23:40:04,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7497#true} {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {7497#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {7497#true} [108] 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[] {7497#true} is VALID [2022-04-27 23:40:04,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {7497#true} [104] __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] {7497#true} is VALID [2022-04-27 23:40:04,045 INFO L272 TraceCheckUtils]: 19: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {7497#true} is VALID [2022-04-27 23:40:04,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [102] 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] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [98] L42-2-->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] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {7497#true} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {7696#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 23:40:04,046 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7497#true} {7497#true} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {7497#true} is VALID [2022-04-27 23:40:04,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {7497#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {7497#true} [96] 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[] {7497#true} is VALID [2022-04-27 23:40:04,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {7497#true} [93] 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] {7497#true} is VALID [2022-04-27 23:40:04,046 INFO L272 TraceCheckUtils]: 11: Hoare triple {7497#true} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {7497#true} is VALID [2022-04-27 23:40:04,046 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7497#true} {7497#true} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {7497#true} is VALID [2022-04-27 23:40:04,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {7497#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {7497#true} [96] 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[] {7497#true} is VALID [2022-04-27 23:40:04,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {7497#true} [93] 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] {7497#true} is VALID [2022-04-27 23:40:04,046 INFO L272 TraceCheckUtils]: 6: Hoare triple {7497#true} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {7497#true} is VALID [2022-04-27 23:40:04,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {7497#true} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {7497#true} is VALID [2022-04-27 23:40:04,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {7497#true} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7497#true} {7497#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {7497#true} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {7497#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {7497#true} is VALID [2022-04-27 23:40:04,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {7497#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7497#true} is VALID [2022-04-27 23:40:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-04-27 23:40:04,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:40:04,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153717966] [2022-04-27 23:40:04,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:40:04,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229079658] [2022-04-27 23:40:04,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229079658] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 23:40:04,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 23:40:04,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-04-27 23:40:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653825377] [2022-04-27 23:40:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:40:04,049 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), 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 61 [2022-04-27 23:40:04,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:40:04,049 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), 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-27 23:40:04,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:40:04,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:40:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:40:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:40:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 23:40:04,072 INFO L87 Difference]: Start difference. First operand 210 states and 240 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-27 23:40:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:04,261 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2022-04-27 23:40:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:40:04,262 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), 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 61 [2022-04-27 23:40:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:40:04,262 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), 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-27 23:40:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 23:40:04,263 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), 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-27 23:40:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 23:40:04,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-27 23:40:04,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:40:04,298 INFO L225 Difference]: With dead ends: 216 [2022-04-27 23:40:04,299 INFO L226 Difference]: Without dead ends: 192 [2022-04-27 23:40:04,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 23:40:04,299 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 23:40:04,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 23:40:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-04-27 23:40:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2022-04-27 23:40:04,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:40:04,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 23:40:04,356 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 23:40:04,357 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 23:40:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:04,360 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2022-04-27 23:40:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2022-04-27 23:40:04,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:40:04,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:40:04,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand 192 states. [2022-04-27 23:40:04,361 INFO L87 Difference]: Start difference. First operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand 192 states. [2022-04-27 23:40:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:04,364 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2022-04-27 23:40:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2022-04-27 23:40:04,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:40:04,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:40:04,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:40:04,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:40:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 125 states have (on average 1.112) internal successors, (139), 129 states have internal predecessors, (139), 38 states have call successors, (38), 26 states have call predecessors, (38), 25 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 23:40:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 212 transitions. [2022-04-27 23:40:04,368 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 212 transitions. Word has length 61 [2022-04-27 23:40:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:40:04,368 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 212 transitions. [2022-04-27 23:40:04,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-27 23:40:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 212 transitions. [2022-04-27 23:40:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-27 23:40:04,369 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:40:04,369 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:40:04,386 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-27 23:40:04,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:40:04,570 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:40:04,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:40:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1503864962, now seen corresponding path program 2 times [2022-04-27 23:40:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:40:04,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782223260] [2022-04-27 23:40:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:40:04,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:40:04,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:40:04,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783478064] [2022-04-27 23:40:04,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 23:40:04,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:40:04,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:40:04,589 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-27 23:40:04,600 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-27 23:40:04,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 23:40:04,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 23:40:04,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 23:40:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:40:04,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:40:05,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {8832#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {8832#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {8840#(<= ~counter~0 0)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8840#(<= ~counter~0 0)} {8832#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {8840#(<= ~counter~0 0)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {8840#(<= ~counter~0 0)} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,091 INFO L272 TraceCheckUtils]: 6: Hoare triple {8840#(<= ~counter~0 0)} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {8840#(<= ~counter~0 0)} [93] 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] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {8840#(<= ~counter~0 0)} [96] 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[] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {8840#(<= ~counter~0 0)} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,092 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8840#(<= ~counter~0 0)} {8840#(<= ~counter~0 0)} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,092 INFO L272 TraceCheckUtils]: 11: Hoare triple {8840#(<= ~counter~0 0)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {8840#(<= ~counter~0 0)} [93] 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] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {8840#(<= ~counter~0 0)} [96] 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[] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {8840#(<= ~counter~0 0)} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,094 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8840#(<= ~counter~0 0)} {8840#(<= ~counter~0 0)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {8840#(<= ~counter~0 0)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {8840#(<= ~counter~0 0)} is VALID [2022-04-27 23:40:05,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {8840#(<= ~counter~0 0)} [98] L42-2-->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] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {8889#(<= ~counter~0 1)} [102] 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] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,095 INFO L272 TraceCheckUtils]: 19: Hoare triple {8889#(<= ~counter~0 1)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {8889#(<= ~counter~0 1)} [104] __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] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {8889#(<= ~counter~0 1)} [108] 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[] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {8889#(<= ~counter~0 1)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,096 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8889#(<= ~counter~0 1)} {8889#(<= ~counter~0 1)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,097 INFO L272 TraceCheckUtils]: 24: Hoare triple {8889#(<= ~counter~0 1)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {8889#(<= ~counter~0 1)} [104] __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] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {8889#(<= ~counter~0 1)} [108] 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[] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {8889#(<= ~counter~0 1)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,098 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8889#(<= ~counter~0 1)} {8889#(<= ~counter~0 1)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,099 INFO L272 TraceCheckUtils]: 29: Hoare triple {8889#(<= ~counter~0 1)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {8889#(<= ~counter~0 1)} [104] __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] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {8889#(<= ~counter~0 1)} [108] 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[] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {8889#(<= ~counter~0 1)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,101 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8889#(<= ~counter~0 1)} {8889#(<= ~counter~0 1)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {8889#(<= ~counter~0 1)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {8889#(<= ~counter~0 1)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {8889#(<= ~counter~0 1)} is VALID [2022-04-27 23:40:05,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {8889#(<= ~counter~0 1)} [98] L42-2-->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] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {8947#(<= ~counter~0 2)} [102] 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] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,103 INFO L272 TraceCheckUtils]: 38: Hoare triple {8947#(<= ~counter~0 2)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {8947#(<= ~counter~0 2)} [104] __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] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {8947#(<= ~counter~0 2)} [108] 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[] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {8947#(<= ~counter~0 2)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,104 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8947#(<= ~counter~0 2)} {8947#(<= ~counter~0 2)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,105 INFO L272 TraceCheckUtils]: 43: Hoare triple {8947#(<= ~counter~0 2)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {8947#(<= ~counter~0 2)} [104] __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] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {8947#(<= ~counter~0 2)} [108] 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[] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {8947#(<= ~counter~0 2)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,106 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8947#(<= ~counter~0 2)} {8947#(<= ~counter~0 2)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,106 INFO L272 TraceCheckUtils]: 48: Hoare triple {8947#(<= ~counter~0 2)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {8947#(<= ~counter~0 2)} [104] __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] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {8947#(<= ~counter~0 2)} [108] 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[] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {8947#(<= ~counter~0 2)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,108 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8947#(<= ~counter~0 2)} {8947#(<= ~counter~0 2)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {8947#(<= ~counter~0 2)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,108 INFO L290 TraceCheckUtils]: 54: Hoare triple {8947#(<= ~counter~0 2)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {8947#(<= ~counter~0 2)} is VALID [2022-04-27 23:40:05,109 INFO L290 TraceCheckUtils]: 55: Hoare triple {8947#(<= ~counter~0 2)} [98] L42-2-->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] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {9005#(<= ~counter~0 3)} [102] 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] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,110 INFO L272 TraceCheckUtils]: 57: Hoare triple {9005#(<= ~counter~0 3)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,110 INFO L290 TraceCheckUtils]: 58: Hoare triple {9005#(<= ~counter~0 3)} [104] __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] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,110 INFO L290 TraceCheckUtils]: 59: Hoare triple {9005#(<= ~counter~0 3)} [108] 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[] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,110 INFO L290 TraceCheckUtils]: 60: Hoare triple {9005#(<= ~counter~0 3)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,111 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {9005#(<= ~counter~0 3)} {9005#(<= ~counter~0 3)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,112 INFO L272 TraceCheckUtils]: 62: Hoare triple {9005#(<= ~counter~0 3)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {9005#(<= ~counter~0 3)} [104] __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] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {9005#(<= ~counter~0 3)} [108] 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[] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {9005#(<= ~counter~0 3)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,113 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9005#(<= ~counter~0 3)} {9005#(<= ~counter~0 3)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,113 INFO L272 TraceCheckUtils]: 67: Hoare triple {9005#(<= ~counter~0 3)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,114 INFO L290 TraceCheckUtils]: 68: Hoare triple {9005#(<= ~counter~0 3)} [104] __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] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,114 INFO L290 TraceCheckUtils]: 69: Hoare triple {9005#(<= ~counter~0 3)} [108] 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[] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {9005#(<= ~counter~0 3)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,115 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9005#(<= ~counter~0 3)} {9005#(<= ~counter~0 3)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {9005#(<= ~counter~0 3)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {9005#(<= ~counter~0 3)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {9005#(<= ~counter~0 3)} is VALID [2022-04-27 23:40:05,116 INFO L290 TraceCheckUtils]: 74: Hoare triple {9005#(<= ~counter~0 3)} [98] L42-2-->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] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,116 INFO L290 TraceCheckUtils]: 75: Hoare triple {9063#(<= ~counter~0 4)} [102] 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] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,116 INFO L272 TraceCheckUtils]: 76: Hoare triple {9063#(<= ~counter~0 4)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {9063#(<= ~counter~0 4)} [104] __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] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {9063#(<= ~counter~0 4)} [108] 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[] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,117 INFO L290 TraceCheckUtils]: 79: Hoare triple {9063#(<= ~counter~0 4)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,118 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9063#(<= ~counter~0 4)} {9063#(<= ~counter~0 4)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,118 INFO L272 TraceCheckUtils]: 81: Hoare triple {9063#(<= ~counter~0 4)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,118 INFO L290 TraceCheckUtils]: 82: Hoare triple {9063#(<= ~counter~0 4)} [104] __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] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,119 INFO L290 TraceCheckUtils]: 83: Hoare triple {9063#(<= ~counter~0 4)} [108] 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[] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,119 INFO L290 TraceCheckUtils]: 84: Hoare triple {9063#(<= ~counter~0 4)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,119 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {9063#(<= ~counter~0 4)} {9063#(<= ~counter~0 4)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,120 INFO L272 TraceCheckUtils]: 86: Hoare triple {9063#(<= ~counter~0 4)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,120 INFO L290 TraceCheckUtils]: 87: Hoare triple {9063#(<= ~counter~0 4)} [104] __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] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,120 INFO L290 TraceCheckUtils]: 88: Hoare triple {9063#(<= ~counter~0 4)} [108] 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[] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,121 INFO L290 TraceCheckUtils]: 89: Hoare triple {9063#(<= ~counter~0 4)} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,121 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {9063#(<= ~counter~0 4)} {9063#(<= ~counter~0 4)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,121 INFO L290 TraceCheckUtils]: 91: Hoare triple {9063#(<= ~counter~0 4)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,122 INFO L290 TraceCheckUtils]: 92: Hoare triple {9063#(<= ~counter~0 4)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {9063#(<= ~counter~0 4)} is VALID [2022-04-27 23:40:05,122 INFO L290 TraceCheckUtils]: 93: Hoare triple {9063#(<= ~counter~0 4)} [98] L42-2-->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] {9121#(<= |main_#t~post6| 4)} is VALID [2022-04-27 23:40:05,122 INFO L290 TraceCheckUtils]: 94: Hoare triple {9121#(<= |main_#t~post6| 4)} [101] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {8833#false} is VALID [2022-04-27 23:40:05,122 INFO L272 TraceCheckUtils]: 95: Hoare triple {8833#false} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {8833#false} is VALID [2022-04-27 23:40:05,122 INFO L290 TraceCheckUtils]: 96: Hoare triple {8833#false} [104] __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] {8833#false} is VALID [2022-04-27 23:40:05,122 INFO L290 TraceCheckUtils]: 97: Hoare triple {8833#false} [107] 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[] {8833#false} is VALID [2022-04-27 23:40:05,123 INFO L290 TraceCheckUtils]: 98: Hoare triple {8833#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8833#false} is VALID [2022-04-27 23:40:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 23:40:05,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:40:05,529 INFO L290 TraceCheckUtils]: 98: Hoare triple {8833#false} [111] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8833#false} is VALID [2022-04-27 23:40:05,529 INFO L290 TraceCheckUtils]: 97: Hoare triple {8833#false} [107] 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[] {8833#false} is VALID [2022-04-27 23:40:05,529 INFO L290 TraceCheckUtils]: 96: Hoare triple {8833#false} [104] __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] {8833#false} is VALID [2022-04-27 23:40:05,529 INFO L272 TraceCheckUtils]: 95: Hoare triple {8833#false} [100] L34-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {8833#false} is VALID [2022-04-27 23:40:05,530 INFO L290 TraceCheckUtils]: 94: Hoare triple {9149#(< |main_#t~post6| 10)} [101] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {8833#false} is VALID [2022-04-27 23:40:05,530 INFO L290 TraceCheckUtils]: 93: Hoare triple {9153#(< ~counter~0 10)} [98] L42-2-->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] {9149#(< |main_#t~post6| 10)} is VALID [2022-04-27 23:40:05,530 INFO L290 TraceCheckUtils]: 92: Hoare triple {9153#(< ~counter~0 10)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {9153#(< ~counter~0 10)} is VALID [2022-04-27 23:40:05,530 INFO L290 TraceCheckUtils]: 91: Hoare triple {9153#(< ~counter~0 10)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {9153#(< ~counter~0 10)} is VALID [2022-04-27 23:40:05,531 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {8832#true} {9153#(< ~counter~0 10)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9153#(< ~counter~0 10)} is VALID [2022-04-27 23:40:05,531 INFO L290 TraceCheckUtils]: 89: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,531 INFO L290 TraceCheckUtils]: 88: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,531 INFO L290 TraceCheckUtils]: 87: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,531 INFO L272 TraceCheckUtils]: 86: Hoare triple {9153#(< ~counter~0 10)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8832#true} is VALID [2022-04-27 23:40:05,532 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {8832#true} {9153#(< ~counter~0 10)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9153#(< ~counter~0 10)} is VALID [2022-04-27 23:40:05,532 INFO L290 TraceCheckUtils]: 84: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,532 INFO L290 TraceCheckUtils]: 83: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,532 INFO L290 TraceCheckUtils]: 82: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,532 INFO L272 TraceCheckUtils]: 81: Hoare triple {9153#(< ~counter~0 10)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8832#true} is VALID [2022-04-27 23:40:05,533 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {8832#true} {9153#(< ~counter~0 10)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {9153#(< ~counter~0 10)} is VALID [2022-04-27 23:40:05,533 INFO L290 TraceCheckUtils]: 79: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,533 INFO L290 TraceCheckUtils]: 78: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,533 INFO L290 TraceCheckUtils]: 77: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,533 INFO L272 TraceCheckUtils]: 76: Hoare triple {9153#(< ~counter~0 10)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {8832#true} is VALID [2022-04-27 23:40:05,533 INFO L290 TraceCheckUtils]: 75: Hoare triple {9153#(< ~counter~0 10)} [102] 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] {9153#(< ~counter~0 10)} is VALID [2022-04-27 23:40:05,534 INFO L290 TraceCheckUtils]: 74: Hoare triple {9211#(< ~counter~0 9)} [98] L42-2-->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] {9153#(< ~counter~0 10)} is VALID [2022-04-27 23:40:05,534 INFO L290 TraceCheckUtils]: 73: Hoare triple {9211#(< ~counter~0 9)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {9211#(< ~counter~0 9)} is VALID [2022-04-27 23:40:05,534 INFO L290 TraceCheckUtils]: 72: Hoare triple {9211#(< ~counter~0 9)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {9211#(< ~counter~0 9)} is VALID [2022-04-27 23:40:05,535 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8832#true} {9211#(< ~counter~0 9)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9211#(< ~counter~0 9)} is VALID [2022-04-27 23:40:05,535 INFO L290 TraceCheckUtils]: 70: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,535 INFO L290 TraceCheckUtils]: 69: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,535 INFO L290 TraceCheckUtils]: 68: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,535 INFO L272 TraceCheckUtils]: 67: Hoare triple {9211#(< ~counter~0 9)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8832#true} is VALID [2022-04-27 23:40:05,536 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8832#true} {9211#(< ~counter~0 9)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9211#(< ~counter~0 9)} is VALID [2022-04-27 23:40:05,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,536 INFO L290 TraceCheckUtils]: 64: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,536 INFO L290 TraceCheckUtils]: 63: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,536 INFO L272 TraceCheckUtils]: 62: Hoare triple {9211#(< ~counter~0 9)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8832#true} is VALID [2022-04-27 23:40:05,536 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {8832#true} {9211#(< ~counter~0 9)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {9211#(< ~counter~0 9)} is VALID [2022-04-27 23:40:05,537 INFO L290 TraceCheckUtils]: 60: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,537 INFO L290 TraceCheckUtils]: 59: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,537 INFO L272 TraceCheckUtils]: 57: Hoare triple {9211#(< ~counter~0 9)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {8832#true} is VALID [2022-04-27 23:40:05,537 INFO L290 TraceCheckUtils]: 56: Hoare triple {9211#(< ~counter~0 9)} [102] 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] {9211#(< ~counter~0 9)} is VALID [2022-04-27 23:40:05,537 INFO L290 TraceCheckUtils]: 55: Hoare triple {9269#(< ~counter~0 8)} [98] L42-2-->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] {9211#(< ~counter~0 9)} is VALID [2022-04-27 23:40:05,538 INFO L290 TraceCheckUtils]: 54: Hoare triple {9269#(< ~counter~0 8)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {9269#(< ~counter~0 8)} is VALID [2022-04-27 23:40:05,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {9269#(< ~counter~0 8)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {9269#(< ~counter~0 8)} is VALID [2022-04-27 23:40:05,538 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8832#true} {9269#(< ~counter~0 8)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9269#(< ~counter~0 8)} is VALID [2022-04-27 23:40:05,538 INFO L290 TraceCheckUtils]: 51: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,539 INFO L272 TraceCheckUtils]: 48: Hoare triple {9269#(< ~counter~0 8)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8832#true} is VALID [2022-04-27 23:40:05,539 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8832#true} {9269#(< ~counter~0 8)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9269#(< ~counter~0 8)} is VALID [2022-04-27 23:40:05,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,539 INFO L272 TraceCheckUtils]: 43: Hoare triple {9269#(< ~counter~0 8)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8832#true} is VALID [2022-04-27 23:40:05,543 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8832#true} {9269#(< ~counter~0 8)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {9269#(< ~counter~0 8)} is VALID [2022-04-27 23:40:05,543 INFO L290 TraceCheckUtils]: 41: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,543 INFO L272 TraceCheckUtils]: 38: Hoare triple {9269#(< ~counter~0 8)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {8832#true} is VALID [2022-04-27 23:40:05,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {9269#(< ~counter~0 8)} [102] 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] {9269#(< ~counter~0 8)} is VALID [2022-04-27 23:40:05,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {9327#(< ~counter~0 7)} [98] L42-2-->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] {9269#(< ~counter~0 8)} is VALID [2022-04-27 23:40:05,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {9327#(< ~counter~0 7)} [119] L42-->L42-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {9327#(< ~counter~0 7)} is VALID [2022-04-27 23:40:05,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {9327#(< ~counter~0 7)} [117] L37-->L42: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {9327#(< ~counter~0 7)} is VALID [2022-04-27 23:40:05,546 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8832#true} {9327#(< ~counter~0 7)} [126] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {9327#(< ~counter~0 7)} is VALID [2022-04-27 23:40:05,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,546 INFO L272 TraceCheckUtils]: 29: Hoare triple {9327#(< ~counter~0 7)} [114] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8832#true} is VALID [2022-04-27 23:40:05,547 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8832#true} {9327#(< ~counter~0 7)} [125] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {9327#(< ~counter~0 7)} is VALID [2022-04-27 23:40:05,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,547 INFO L272 TraceCheckUtils]: 24: Hoare triple {9327#(< ~counter~0 7)} [109] L35-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8832#true} is VALID [2022-04-27 23:40:05,547 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8832#true} {9327#(< ~counter~0 7)} [124] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {9327#(< ~counter~0 7)} is VALID [2022-04-27 23:40:05,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {8832#true} [113] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {8832#true} [108] 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[] {8832#true} is VALID [2022-04-27 23:40:05,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {8832#true} [104] __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] {8832#true} is VALID [2022-04-27 23:40:05,548 INFO L272 TraceCheckUtils]: 19: Hoare triple {9327#(< ~counter~0 7)} [105] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {8832#true} is VALID [2022-04-27 23:40:05,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {9327#(< ~counter~0 7)} [102] 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] {9327#(< ~counter~0 7)} is VALID [2022-04-27 23:40:05,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {9385#(< ~counter~0 6)} [98] L42-2-->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] {9327#(< ~counter~0 7)} is VALID [2022-04-27 23:40:05,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {9385#(< ~counter~0 6)} [94] L25-->L42-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {9385#(< ~counter~0 6)} is VALID [2022-04-27 23:40:05,551 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8832#true} {9385#(< ~counter~0 6)} [123] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {9385#(< ~counter~0 6)} is VALID [2022-04-27 23:40:05,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {8832#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {8832#true} [96] 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[] {8832#true} is VALID [2022-04-27 23:40:05,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {8832#true} [93] 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] {8832#true} is VALID [2022-04-27 23:40:05,552 INFO L272 TraceCheckUtils]: 11: Hoare triple {9385#(< ~counter~0 6)} [92] L24-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {8832#true} is VALID [2022-04-27 23:40:05,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8832#true} {9385#(< ~counter~0 6)} [122] 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_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {9385#(< ~counter~0 6)} is VALID [2022-04-27 23:40:05,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {8832#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {8832#true} [96] 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[] {8832#true} is VALID [2022-04-27 23:40:05,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {8832#true} [93] 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] {8832#true} is VALID [2022-04-27 23:40:05,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {9385#(< ~counter~0 6)} [91] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {8832#true} is VALID [2022-04-27 23:40:05,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {9385#(< ~counter~0 6)} [89] 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_4, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {9385#(< ~counter~0 6)} is VALID [2022-04-27 23:40:05,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {9385#(< ~counter~0 6)} [86] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9385#(< ~counter~0 6)} is VALID [2022-04-27 23:40:05,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9385#(< ~counter~0 6)} {8832#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9385#(< ~counter~0 6)} is VALID [2022-04-27 23:40:05,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {9385#(< ~counter~0 6)} [90] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9385#(< ~counter~0 6)} is VALID [2022-04-27 23:40:05,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {8832#true} [87] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {9385#(< ~counter~0 6)} is VALID [2022-04-27 23:40:05,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {8832#true} [85] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8832#true} is VALID [2022-04-27 23:40:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-27 23:40:05,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:40:05,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782223260] [2022-04-27 23:40:05,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:40:05,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783478064] [2022-04-27 23:40:05,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783478064] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:40:05,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 23:40:05,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 23:40:05,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278084989] [2022-04-27 23:40:05,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 23:40:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 99 [2022-04-27 23:40:05,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:40:05,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-04-27 23:40:05,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:40:05,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 23:40:05,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:40:05,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 23:40:05,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 23:40:05,656 INFO L87 Difference]: Start difference. First operand 189 states and 212 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-04-27 23:40:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:06,406 INFO L93 Difference]: Finished difference Result 516 states and 605 transitions. [2022-04-27 23:40:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 23:40:06,407 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 99 [2022-04-27 23:40:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:40:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-04-27 23:40:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 176 transitions. [2022-04-27 23:40:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-04-27 23:40:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 176 transitions. [2022-04-27 23:40:06,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 176 transitions. [2022-04-27 23:40:06,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:40:06,547 INFO L225 Difference]: With dead ends: 516 [2022-04-27 23:40:06,548 INFO L226 Difference]: Without dead ends: 507 [2022-04-27 23:40:06,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 23:40:06,549 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 88 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:40:06,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 220 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 23:40:06,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-27 23:40:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2022-04-27 23:40:06,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:40:06,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 23:40:06,760 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 23:40:06,761 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 23:40:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:06,776 INFO L93 Difference]: Finished difference Result 507 states and 572 transitions. [2022-04-27 23:40:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 572 transitions. [2022-04-27 23:40:06,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:40:06,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:40:06,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) Second operand 507 states. [2022-04-27 23:40:06,778 INFO L87 Difference]: Start difference. First operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) Second operand 507 states. [2022-04-27 23:40:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:40:06,790 INFO L93 Difference]: Finished difference Result 507 states and 572 transitions. [2022-04-27 23:40:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 572 transitions. [2022-04-27 23:40:06,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:40:06,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:40:06,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:40:06,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:40:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 335 states have (on average 1.0955223880597016) internal successors, (367), 345 states have internal predecessors, (367), 104 states have call successors, (104), 68 states have call predecessors, (104), 67 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) [2022-04-27 23:40:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 572 transitions. [2022-04-27 23:40:06,815 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 572 transitions. Word has length 99 [2022-04-27 23:40:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:40:06,817 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 572 transitions. [2022-04-27 23:40:06,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (32), 8 states have call predecessors, (32), 7 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-04-27 23:40:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 572 transitions. [2022-04-27 23:40:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-04-27 23:40:06,819 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:40:06,820 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:40:06,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-27 23:40:07,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 23:40:07,037 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:40:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:40:07,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1084056642, now seen corresponding path program 3 times [2022-04-27 23:40:07,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:40:07,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670203720] [2022-04-27 23:40:07,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:40:07,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:40:07,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:40:07,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928259385] [2022-04-27 23:40:07,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 23:40:07,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:40:07,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:40:07,055 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-27 23:40:07,056 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-27 23:40:07,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2022-04-27 23:40:07,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 23:40:07,168 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 23:40:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 23:40:07,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 23:40:07,311 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 23:40:07,312 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 23:40:07,335 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-27 23:40:07,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 23:40:07,522 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:40:07,524 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 23:40:07,604 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 23:40:07,605 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 23:40:07,605 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-27 23:40:07,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:40:07 BasicIcfg [2022-04-27 23:40:07,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 23:40:07,606 INFO L158 Benchmark]: Toolchain (without parser) took 70993.35ms. Allocated memory was 168.8MB in the beginning and 212.9MB in the end (delta: 44.0MB). Free memory was 117.3MB in the beginning and 144.0MB in the end (delta: -26.7MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2022-04-27 23:40:07,606 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory was 133.4MB in the beginning and 133.3MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 23:40:07,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.12ms. Allocated memory was 168.8MB in the beginning and 212.9MB in the end (delta: 44.0MB). Free memory was 117.1MB in the beginning and 188.8MB in the end (delta: -71.7MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. [2022-04-27 23:40:07,607 INFO L158 Benchmark]: Boogie Preprocessor took 23.03ms. Allocated memory is still 212.9MB. Free memory was 188.8MB in the beginning and 187.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 23:40:07,607 INFO L158 Benchmark]: RCFGBuilder took 266.76ms. Allocated memory is still 212.9MB. Free memory was 187.5MB in the beginning and 175.2MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 23:40:07,607 INFO L158 Benchmark]: IcfgTransformer took 34.34ms. Allocated memory is still 212.9MB. Free memory was 175.2MB in the beginning and 173.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 23:40:07,607 INFO L158 Benchmark]: TraceAbstraction took 70457.32ms. Allocated memory is still 212.9MB. Free memory was 173.1MB in the beginning and 144.0MB in the end (delta: 29.1MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. [2022-04-27 23:40:07,608 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory was 133.4MB in the beginning and 133.3MB in the end (delta: 74.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.12ms. Allocated memory was 168.8MB in the beginning and 212.9MB in the end (delta: 44.0MB). Free memory was 117.1MB in the beginning and 188.8MB in the end (delta: -71.7MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.03ms. Allocated memory is still 212.9MB. Free memory was 188.8MB in the beginning and 187.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 266.76ms. Allocated memory is still 212.9MB. Free memory was 187.5MB in the beginning and 175.2MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 34.34ms. Allocated memory is still 212.9MB. Free memory was 175.2MB in the beginning and 173.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 70457.32ms. Allocated memory is still 212.9MB. Free memory was 173.1MB in the beginning and 144.0MB in the end (delta: 29.1MB). Peak memory consumption was 29.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] long long a, b, p, q, r, s; [L21] int x, y; [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=12, y=1] [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=12, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=12, b=1, counter=0, p=1, q=0, r=0, s=1, x=12, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=12, b=1, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=11, b=1, counter=1, p=1, q=0, r=-1, s=1, x=12, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=11, b=1, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=10, b=1, counter=2, p=1, q=0, r=-2, s=1, x=12, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=10, b=1, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=9, b=1, counter=3, p=1, q=0, r=-3, s=1, x=12, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=9, b=1, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=8, b=1, counter=4, p=1, q=0, r=-4, s=1, x=12, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=8, b=1, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L36] 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] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L37] 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] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=7, b=1, counter=5, p=1, q=0, r=-5, s=1, x=12, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=7, b=1, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=6, b=1, counter=6, p=1, q=0, r=-6, s=1, x=12, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=6, b=1, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=5, b=1, counter=7, p=1, q=0, r=-7, s=1, x=12, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=5, b=1, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=4, b=1, counter=8, p=1, q=0, r=-8, s=1, x=12, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=4, b=1, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L36] 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] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L37] 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] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=3, b=1, counter=9, p=1, q=0, r=-9, s=1, x=12, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=1, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=2, b=1, counter=10, p=1, q=0, r=-10, s=1, x=12, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=12, y=1] [L34] COND FALSE !(counter++<10) [L53] CALL __VERIFIER_assert(a - b == 0) 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.3s, OverallIterations: 13, TraceHistogramMax: 31, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 1669 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1170 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 877 IncrementalHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 499 mSDtfsCounter, 877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 726 SyntacticMatches, 8 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=507occurred in iteration=12, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 40 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 58.9s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 811 ConstructedInterpolants, 0 QuantifiedInterpolants, 2401 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1453 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 790/1151 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-27 23:40:07,628 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...